MétaCan
Menu
Back to cohort
Record W2096451472 · doi:10.1109/tkde.2005.50

Using AUC and accuracy in evaluating learning algorithms

2005· article· en· W2096451472 on OpenAlexaff
Jin Huang, Charles X. Ling

Bibliographic record

VenueIEEE Transactions on Knowledge and Data Engineering · 2005
Typearticle
Languageen
FieldComputer Science
TopicImbalanced Data Classification Techniques
Canadian institutionsWestern University
Fundersnot available
KeywordsMachine learningComputer scienceArtificial intelligenceNaive Bayes classifierDecision treeMeasure (data warehouse)Receiver operating characteristicAlgorithmBayes' theoremData miningSupport vector machineBayesian probability

Abstract

fetched live from OpenAlex

The area under the ROC (receiver operating characteristics) curve, or simply AUC, has been traditionally used in medical diagnosis since the 1970s. It has recently been proposed as an alternative single-number measure for evaluating the predictive ability of learning algorithms. However, no formal arguments were given as to why AUC should be preferred over accuracy. We establish formal criteria for comparing two different measures for learning algorithms and we show theoretically and empirically that AUC is a better measure (defined precisely) than accuracy. We then reevaluate well-established claims in machine learning based on accuracy using AUC and obtain interesting and surprising new results. For example, it has been well-established and accepted that Naive Bayes and decision trees are very similar in predictive accuracy. We show, however, that Naive Bayes is significantly better than decision trees in AUC. The conclusions drawn in this paper may make a significant impact on machine learning and data mining applications.

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.059
metaresearch head score (Gemma)0.333
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: none
Teacher disagreement score0.059
Threshold uncertainty score0.311

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0590.333
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0220.016
Science and technology studies0.0010.004
Scholarly communication0.0100.012
Open science0.0020.004
Research integrity0.0050.004
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.091
GPT teacher head0.364
Teacher spread0.274 · 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

Citations2,141
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Knowledge and Data EngineeringSame topicImbalanced Data Classification TechniquesFrench-language works237,207