Complexity in the case against accuracy estimation
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- A hybrid filter/wrapper approach of feature selection using information theory
- A theory of the learnable
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Improved boosting algorithms using confidence-rated predictions
- Learning DNF in time
- Robust classification for imprecise environments
- Robust trainability of single neurons
- Very simple classification rules perform well on most commonly used datasets
Cited in
(6)- Self-improved gaps almost everywhere for the agnostic approximation of monomials
- On accuracy-based fitness
- Computer Experiments: Prediction Accuracy, Sample Size and Model Complexity Revisited
- Complexity-based induction
- Comprehensive vs. comprehensible classifiers in logical analysis of data
- On speed versus accuracy: Some case studies
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)
