MétaCan
Menu
Back to cohort

Truncated singular value decomposition for semantic-based data retrieval

2013· article· en· W2005656884 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicText and Document Classification Technologies
Canadian institutionsUniversité du Québec à Montréal
FundersUniversité du Québec à Trois-Rivières
KeywordsIndexationVector space modelComputer scienceSearch engine indexingWeightingDimension (graph theory)Information retrievalSingular value decompositionAbstractionRepresentation (politics)Explicit semantic analysisVector spaceKnowledge representation and reasoningData miningNatural language processingArtificial intelligenceSemantic computingMathematicsSemantic technologySemantic Web

Abstract

fetched live from OpenAlex

This paper addresses the increasingly encountered challenge of knowledge indexation. In the past decade, research on numerical schemes on knowledge indexation has been quite intensive. Vector space model is only based on the information contained in term weighting and does therefore not process the semantic contained in the sequence in which the words appear in a bag-of-words. This representation provides an abstraction of semantic relations between different linguistic units. A novel semantic-based method for knowledge indexation, which can provide improvement in both indexing and retrieval, is described. Despite a huge dimension in vector space model size, retrieval accuracies are seen to improve significantly when the proposed system is applied for indexing Reuters-21578 corpus.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.872
Threshold uncertainty score0.323

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.043
GPT teacher head0.309
Teacher spread0.265 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it