MétaCan
Menu
Back to cohort
Record W3099704538

Fractionally-Supervised Classification

2016· article· en· W3099704538 on OpenAlexaff
Irene Vrbik, Paul D. McNicholas

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicBayesian Methods and Mixture Models
Canadian institutionsMcMaster UniversityMcGill University
Fundersnot available
KeywordsArtificial intelligenceCluster analysisPattern recognition (psychology)Classifier (UML)A priori and a posterioriSupervised learningMachine learningMixture modelMathematicsGaussianUnsupervised learningComputer scienceArtificial neural network
DOInot available

Abstract

fetched live from OpenAlex

Traditionally, there are three species of classification: unsupervised, supervised, and semi-supervised. Supervised and semi-supervised classification differ by whether or not weight is given to unlabelled observations in the classification procedure. In un-supervised classification, or clustering, either there are no labelled observations or the labels are ignored altogether. A priori it can very difficult to choose the optimal level of supervision, and the consequences of a sub-optimal choice can be rather severe. A flexible fractionally-supervised approach to classification is introduced, where any level of supervision — ranging from unsupervised to supervised — can be attained. Our approach uses a weighted likelihood, wherein weights control the level of supervision. Gaussian mixture models are used as a vehicle to illustrate our fractionally-supervised classification approach; however, it is broadly applicable and variations on the pos-tulated model can easily be made by adjusting the weights. A comparison between our approach and the traditional species is presented using benchmark model-based clustering data.

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.005
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.015
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0020.002
Science and technology studies0.0020.002
Scholarly communication0.0030.004
Open science0.0040.003
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0040.002

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.035
GPT teacher head0.277
Teacher spread0.242 · 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 designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations19
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicBayesian Methods and Mixture ModelsFrench-language works237,207