The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Complexity measures of supervised classification problems
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Statistical pattern recognition: a review
Jain, A. K., Duin, P. W., & Mao, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824819 · Cited by 6,767
Three approaches to the quantitative definition of information*
Kolmogorov, A. N. (1968) · International Journal of Computer Mathematics · doi:10.1080/00207166808803030 · Cited by 2,031
Small sample size effects in statistical pattern recognition: Recommendations for practitioners
Raudys, S. J., & Jain, A. K. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.75512 · Cited by 1,384
A Theory of Program Size Formally Identical to Information Theory
Chaitin, G. J. (1975) · Journal of the ACM · doi:10.1145/321892.321894 · Cited by 849
Multivariate Generalizations of the Wald-Wolfowitz and Smirnov Two-Sample Tests
Friedman, J. H., & Rafsky, L. C. (1979) · The Annals of Statistics · doi:10.1214/aos/1176344722 · Cited by 665
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (1993) · Springer eBooks · doi:10.1007/978-1-4757-3860-5 · Cited by 638
Gasarch, W. (1997) · ACM SIGACT News · doi:10.1145/262301.1040343 · Cited by 583
Gell-Mann, M. (2002) · Contributions to Economics · doi:10.1007/978-3-642-50007-7_2 · Cited by 455
An evaluation of intrinsic dimensionality estimators
Verveer, P. J., & Duin, R. P. W. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.368147 · Cited by 159
An overtraining-resistant stochastic modeling method for pattern recognition
Kleinberg, E. M. (1996) · The Annals of Statistics · doi:10.1214/aos/1032181157 · Cited by 145
Meta analysis of classification algorithms for pattern recognition
Sohn, S. Y. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.809107 · Cited by 122
MULTIPLE CLASSIFIER COMBINATION: LESSONS AND NEXT STEPS
Ho, T. K. (2002) · Series in machine perception and artificial intelligence · doi:10.1142/9789812778147_0007 · Cited by 117
Self-citationComplexity of Classification Problems and Comparative Advantages of Combined Classifiers
Ho, T. K. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45014-9_9 · Cited by 71
Self-citationMeasuring the complexity of classification problems
Ho, T. K., & Basu, M. (2002) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.2000.906015 · Cited by 43
Self-citationModel discrimination using an algorithmic information criterion
Maciejowski, J. M. (1979) · Automatica · doi:10.1016/0005-1098(79)90006-2 · Cited by 33
The learning behavior of single neuron classifiers on linearly separable or nonseparable input
Basu, M., & Ho, T. K. (2003) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1999.831142 · Cited by 29
Self-citation
Cited by
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
SMOTE for Learning from Imbalanced Data: Progress and Challenges, Marking the 15-year Anniversary
Fernandez, A., Garcia, S., Herrera, F., & Chawla, N. V. (2018) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.11192 · Cited by 2,219
Graph-based approach for airborne light detection and ranging segmentation
Vilariño, D. L., Cabaleiro, J. C., Martínez, J., Rivera, F. F., & Pena, T. F. (2017) · Journal of Applied Remote Sensing · doi:10.1117/1.jrs.11.015020 · Cited by 1,721
Automated Machine Learning: Methods, Systems, Challenges
(2019) · The Springer Series on Challenges in Machine Learning · doi:10.1007/978-3-030-05318-5 · Cited by 1,485
A unifying view on dataset shift in classification
Moreno-Torres, J. G., Raeder, T., Alaiz-Rodríguez, R., Chawla, N. V., & Herrera, F. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2011.06.019 · Cited by 1,029
Metadata
- Authors
- Ho, T. K., & Basu, M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2002-03
- Volume
- 24
- Issue
- 3
- Pages
- 289-300
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2125877832
- Cited by
- 734
- References
- 20
- FWCI
- 9.03
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.