The DOI matches its Crossref record.
STATLOG: COMPARISON OF CLASSIFICATION ALGORITHMS ON LARGE REAL-WORLD PROBLEMS
Abstract
This paper describes work in the StatLog project comparing classification algorithms on large real-world problems. The algorithms compared were from symbolic learning (CART. C4.5, NewID, AC2,ITrule, Cal5, CN2), statistics (Naive Bayes, k-nearest neighbor, kernel density, linear discriminant, quadratic discriminant, logistic regression, projection pursuit, Bayesian networks), and neural networks (backpropagation, radial basis functions). Twelve datasets were used: five from image analysis, three from medicine, and two each from engineering and finance. We found that which algorithm performed best depended critically on the data set investigated. We therefore developed a set of data set descriptors to help decide which algorithms are suited to particular data sets. For example, data sets with extreme distributions (skew > l and kurtosis > 7) and with many binary/categorical attributes (>38%) tend to favor symbolic learning algorithms. We suggest how classification algorithms can be extended in a number of directions.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“LDP has been deployed effectively to gather statistics on popular items across large userbases by Google, Apple and Microsoft [177, 154, 155].”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [155]
In the citing paper
“While LDP protocols are effective at enforcing privacy and have theoretical justifications [177, 154, 155]”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [155]
Citations
Cites
Still being checked.
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“Hyperparameter optimization (HPO) has a long history under the framework of AutoML [339, 237, 241], but it mainly concerns how to improve the model accuracy [59, 364, 321, 159] rather than communication and computing efficacy for”
BackgroundAn empirical comparison of supervised learning algorithms
Caruana, R., & Niculescu-Mizil, A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143865 · Cited by 2,780
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
Feurer, M., & Hutter, F. (2019) · The Springer Series on Challenges in Machine Learning · doi:10.1007/978-3-030-05318-5_1 · Cited by 1,414
Emotion recognition based on physiological changes in music listening
Kim, J., & Andre, E. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.26 · Cited by 1,082
Metadata
- Authors
- KING, R. D., FENG, C., & SUTHERLAND, A.
- Affiliations
- University of Strathclyde (GB)
- Turing Institute (GB)
- ORCID
- Venue
- Applied Artificial Intelligence
- Publisher
- Informa UK Limited
- Published
- 1995-05
- Volume
- 9
- Issue
- 3
- Pages
- 289-333
- ISSN
- 0883-9514 (ISSN-L)
- 1087-6545
- OpenAlex
- W1985995090
- Cited by
- 320
- References
- 0
- Citations by year
- 2025: 11 · 2024: 9 · 2023: 9 · 2022: 9 · 2021: 17 · 2020: 16 · 2019: 20 · 2018: 15 · 2017: 18 · 2016: 23 · 2015: 17 · 2014: 15 · 2013: 13 · 2012: 20
- FWCI
- 6.55
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Applied Artificial Intelligence (publishedVersion)
- Research Explorer (The University of Manchester) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Applications
- Keywords
- machine learning classifiers, algorithm comparison, symbolic learning, statistical learning, artificial neural networks, naive Bayes, k-nearest neighbors, discriminant analysis, logistic regression, projection pursuit, Bayesian networks, backpropagation, radial basis functions, data distribution, categorical variables, image analysis, health data
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: STATLOG: COMPARISON OF CLASSIFICATION ALGORITHMS ON LARGE REAL-WORLD PROBLEMS. https://app.cochat.ai/papers/10.1080/08839519508945477
- The paper
- KING, R. D., FENG, C., & SUTHERLAND, A. (1995). STATLOG: COMPARISON OF CLASSIFICATION ALGORITHMS ON LARGE REAL-WORLD PROBLEMS. Applied Artificial Intelligence. https://doi.org/10.1080/08839519508945477
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.