MétaCan
Menu
Back to cohort
Record W4245055982 · doi:10.1017/cbo9780511921803

Evaluating Learning Algorithms

2011· book· en· W4245055982 on OpenAlexaff
Nathalie Japkowicz, Mohak Shah

Bibliographic record

VenueCambridge University Press eBooks · 2011
Typebook
Languageen
FieldComputer Science
TopicMachine Learning and Data Classification
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer scienceMachine learningArtificial intelligenceResamplingInterdependenceField (mathematics)Process (computing)Classifier (UML)AlgorithmManagement scienceEngineeringMathematics

Abstract

fetched live from OpenAlex

The field of machine learning has matured to the point where many sophisticated learning approaches can be applied to practical applications. Thus it is of critical importance that researchers have the proper tools to evaluate learning approaches and understand the underlying issues. This book examines various aspects of the evaluation process with an emphasis on classification algorithms. The authors describe several techniques for classifier performance assessment, error estimation and resampling, obtaining statistical significance as well as selecting appropriate domains for evaluation. They also present a unified evaluation framework and highlight how different components of evaluation are both significantly interrelated and interdependent. The techniques presented in the book are illustrated using R and WEKA, facilitating better practical insight as well as implementation. Aimed at researchers in the theory and applications of machine learning, this book offers a solid basis for conducting performance evaluations of algorithms in practical settings.

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.081
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.018
Threshold uncertainty score0.084

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0160.081
Meta-epidemiology (narrow)0.0020.000
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0030.003
Science and technology studies0.0010.002
Scholarly communication0.0080.006
Open science0.0020.002
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.0180.008

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.065
GPT teacher head0.269
Teacher spread0.204 · 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

Citations753
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueCambridge University Press eBooksSame topicMachine Learning and Data ClassificationFrench-language works237,207