MétaCan
Menu
Back to cohort
Record W2170783728 · doi:10.1002/meet.14505001072

Exact versus estimated pruning of subject hierarchies

2013· article· en· W2170783728 on OpenAlexaff
Charles‐Antoine Julien, Pierre Tirilly

Bibliographic record

VenueProceedings of the American Society for Information Science and Technology · 2013
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Text Analysis Techniques
Canadian institutionsMcGill University
Fundersnot available
KeywordsSubject (documents)HierarchyComputer sciencePruningData scienceInformation retrievalVisualizationArtificial intelligenceTheoretical computer scienceWorld Wide Web

Abstract

fetched live from OpenAlex

Abstract Many large digital collections are organized by subject; these useful information organization structures are large and complex, thus difficult to browse. Current online tools and visualization prototypes show small localized subsets and do not provide the ability to explore the predominant patterns of the overall subject structure. This study builds on existing work concerning automatic subject hierarchy modification techniques that aim to facilitate browsing for documents by capitalizing on the highly uneven distribution of real‐world collections. Specifically, previous work used an estimation of the number of accessible documents offered by each subject term, while the current study uses the exact number of accessible documents. The impact is demonstrated on a large collection organized using Medical Subject Headings (MeSH). Results show that, although computationally more demanding, pruning the MeSH hierarchy based on the exact access produces a different subject hierarchy under some conditions. The visual impact is demonstrated using traditional outline views. This study has implications for the development of information organization theory and human‐information interaction techniques for subject hierarchies.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.030
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.030
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.014
GPT teacher head0.283
Teacher spread0.269 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the American Society for Information Science and TechnologySame topicAdvanced Text Analysis TechniquesFrench-language works237,207