Complexity in the case against accuracy estimation

DOI10.1016/S0304-3975(02)00573-XzbMath1022.68110OpenAlexW2089292714MaRDI QIDQ1399985

Richard Nock

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

zbMATH Keywords

classifiers

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (1)

Self-improved gaps almost everywhere for the agnostic approximation of monomials

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid filter/wrapper approach of feature selection using information theory
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Robust trainability of single neurons
• Improved boosting algorithms using confidence-rated predictions
• Very simple classification rules perform well on most commonly used datasets
• A theory of the learnable
• Learning DNF in time
• Robust classification for imprecise environments

This page was built for publication: Complexity in the case against accuracy estimation