Complexity in the case against accuracy estimation
From MaRDI portal
Publication:1399985
DOI10.1016/S0304-3975(02)00573-XzbMATH Open1022.68110OpenAlexW2089292714MaRDI QIDQ1399985FDOQ1399985
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00573-x
Recommendations
- scientific article; zbMATH DE number 1453038
- Assessing the performance of classification methods
- Complexity-based induction
- A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms
- Comprehensive vs. comprehensible classifiers in logical analysis of data
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Very simple classification rules perform well on most commonly used datasets
- Title not available (Why is that?)
- Improved boosting algorithms using confidence-rated predictions
- Title not available (Why is that?)
- Robust classification for imprecise environments
- A theory of the learnable
- Learning DNF in time
- Robust trainability of single neurons
- A hybrid filter/wrapper approach of feature selection using information theory
Cited In (6)
- Comprehensive vs. comprehensible classifiers in logical analysis of data
- Self-improved gaps almost everywhere for the agnostic approximation of monomials
- On speed versus accuracy: Some case studies
- On accuracy-based fitness
- Computer Experiments: Prediction Accuracy, Sample Size and Model Complexity Revisited
- Complexity-based induction
This page was built for publication: Complexity in the case against accuracy estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399985)
