Complexity measures of supervised classification problems
Top Cited Papers
- 7 August 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 24 (3) , 289-300
- https://doi.org/10.1109/34.990132
Abstract
We studied a number of measures that characterize the difficulty of a classification problem, focusing on the geometrical complexity of the class boundary. We compared a set of real-world problems to random labelings of points and found that real problems contain structures in this measurement space that are significantly different from the random sets. Distributions of problems in this space show that there exist at least two independent factors affecting a problem's difficulty. We suggest using this space to describe a classifier's domain of competence. This can guide static and dynamic selection of classifiers for specific problems as well as subproblems formed by confinement, projection, and transformations of the feature vectors.Keywords
This publication has 20 references indexed in Scilit:
- Measuring the complexity of classification problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- MULTIPLE CLASSIFIER COMBINATION: LESSONS AND NEXT STEPSSeries in Machine Perception and Artificial Intelligence, 2002
- Statistical pattern recognition: a reviewPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2000
- Meta analysis of classification algorithms for pattern recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Pattern Classification with Compact Distribution MapsComputer Vision and Image Understanding, 1998
- Large-scale simulation studies in image pattern recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- An overtraining-resistant stochastic modeling method for pattern recognitionThe Annals of Statistics, 1996
- On the nonlinearity of pattern classifiersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- An Introduction to Kolmogorov Complexity and Its ApplicationsPublished by Springer Nature ,1993
- Pattern Classifier Design by Linear ProgrammingIEEE Transactions on Computers, 1968