Cited by 767Machine Learning and Data ClassificationImbalanced Data Classification TechniquesData Mining and Machine Learning Applications

Evaluating Learning Algorithms: A Classification Perspective

Japkowicz, Nathalie, Shah, Mohak·2011·Cambridge University Press eBooks

Abstract

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.

Integrity signals

Registry

Crossref · 10.1017/cbo9780511921803

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Many epistemic aspects of algorithmic models are open to question in various contexts.

    “First, many epistemic aspects of algorithmic models are open to question in various contexts.”

    From Algorithmic Accountability and Public Reason (2018) · cites this paper as Japkowicz & Shah, 2011

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Japkowicz, N., & Shah, M.
Affiliations
  • American University (US)
  • McGill University (CA)
Venue
Cambridge University Press eBooks
Published
2011-01-17
OpenAlex
W4245055982
Cited by
767
References
1
Citations by year
2026: 37 · 2025: 62 · 2024: 58 · 2023: 69 · 2022: 75 · 2021: 68 · 2020: 71 · 2019: 55 · 2018: 53 · 2017: 43 · 2016: 48 · 2015: 42 · 2014: 46 · 2013: 29 · 2012: 8
FWCI
11.11
Type
book
Language
en
Open access
closed
Locations
Cambridge University Press eBooks (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Artificial Intelligence › Imbalanced Data Classification Techniques
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
Keywords
error estimation, resampling, statistical significance testing, evaluation framework, machine learning classifiers, WEKA, R

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review