MétaCan
Menu
Back to cohort
Record W4313644201 · doi:10.31219/osf.io/2t53f

An Empirical Study of Supervised and Active Learning Methodologies for Classifying Research Papers

2023· preprint· en· W4313644201 on OpenAlexaff
Jaskaran Singh, Jaspreet Singh Dhani, Tirth Patel, Simrat Bains

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicText and Document Classification Technologies
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMachine learningArtificial intelligenceComputer scienceRandom forestNaive Bayes classifierSupervised learningSemi-supervised learningClass (philosophy)Active learning (machine learning)OversamplingSet (abstract data type)Empirical researchInstance-based learningEnsemble learningSupport vector machineArtificial neural networkMathematics

Abstract

fetched live from OpenAlex

Document classification is one of the predominant tasks in Machine Learning, that by and large involves the use of supervised methodologies to determine most suitable categories for a given set of documents. In this project, we seek to conduct an empirical study, that, in addition to the conventional machine learning methods, experiments with active learning and semi-supervised methods for assorting a mix of labelled and unlabelled computer science scholarly articles hosted on the arXiV repository. We develop a solution using the gathered labelled data points, by experimenting with various multi-class supervised learning models such as K Nearest Neighbours, Naive Bayes, Random Forest, and Logistic Regression. We also account for the issue of class imbalance, and thus conduct experiments to determine a suitable oversampling methodology for addressing this concern. Lastly, we extend beyond the conventional machine learning classification methods to incorporate the concept of active learning, a type of iterative supervised learning, used when the unlabelled data is in abundance.

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.078
metaresearch head score (Gemma)0.382
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.078
Threshold uncertainty score0.413

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0780.382
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0060.005
Science and technology studies0.0010.003
Scholarly communication0.0030.007
Open science0.0020.001
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0010.001

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.536
GPT teacher head0.529
Teacher spread0.007 · 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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicText and Document Classification TechnologiesFrench-language works237,207