MétaCan
Menu
Back to cohort
Record W2130734227 · doi:10.1109/ccece.2004.1344986

Evaluation of three dimensionality reduction techniques for document classification

2004· article· en· W2130734227 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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicText and Document Classification Technologies
Canadian institutionsDalhousie University
Fundersnot available
KeywordsDimensionality reductionComputer scienceCurse of dimensionalityReduction (mathematics)Artificial intelligenceLatent semantic analysisCategorizationDocument classificationSearch engine indexingMachine learningData miningRepresentation (politics)Measure (data warehouse)Pattern recognition (psychology)Information retrievalMathematics

Abstract

fetched live from OpenAlex

High dimensional document collections restrict the choice of data processing methods, especially machine learning methods, which need to calculate the inter-vector distances. The paper describes the development and evaluation of three different dimensionality reduction methods for document representation. Specifically, these methods are latent semantic indexing, random mapping and the two combined together. We are interested in how far these dimensionality reduction methods affect accurate measurement of document categorization. The results show that LSI performs better in terms of the F1-measure; however RM+LSI has a very close performance record with a much lower computational cost.

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.002
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: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.786
Threshold uncertainty score0.276

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.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.0000.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.099
GPT teacher head0.348
Teacher spread0.250 · 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