MétaCan
Menu
Back to cohort
Record W2156273182 · doi:10.1109/icmlc.2002.1175377

Coverage-performance curves for classification in datasets with a typical data

2003· article· en· W2156273182 on OpenAlexaff
Seyyed Mohammad Reza Hashemi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Data Classification
Canadian institutionsDalhousie University
Fundersnot available
KeywordsComputer scienceSupport vector machineScheme (mathematics)Function (biology)Pattern recognition (psychology)Contextual image classificationFraction (chemistry)Data miningArtificial intelligenceMachine learningImage (mathematics)Mathematics

Abstract

fetched live from OpenAlex

Handling atypical examples in classification tasks is one of the challenges in machine learning. While there seems to be a race for accuracy, very little has been done to understand and solve the issues related to atypical data. In this paper, coverage-performance (CP) curves are introduced to help a better understanding of atypical data. The concept of CP curves is based on the idea of separating atypical data and visualizing performance of classification as a function of coverage (the fraction of data participating in training or evaluation). To generate CP curves, two schemes are compared in this paper. The first scheme is based on SVMs alone and the second one is a hybrid of a PNN and a SVM. Two generated datasets with overlapping features are used to demonstrate the effectiveness of CP curves obtained by each scheme. Calculated theoretical limits on the generated data show that the hybrid scheme is a very effective way of producing CP curves. It is also shown that by separating atypical data, although we lose some data, the performance of the classification increases significantly.

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.016
metaresearch head score (Gemma)0.111
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.016
Threshold uncertainty score0.087

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0160.111
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0050.003
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0010.003
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.0020.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.066
GPT teacher head0.309
Teacher spread0.243 · 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

Citations3
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and Data ClassificationFrench-language works237,207