The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Overfitting Avoidance as Bias
Open accessOverview
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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The most common interpretation of an Occamist bias is that amongst all hypotheses consistent with the data, the simplest is the most likely 28 .”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Schaffer, 1993
Experimental — accuracy not yet measured
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,867
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 21,030
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Practical Nonparametric Statistics
Groggel, D. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271101 · Cited by 11,076
Applied Nonparametric Statistics
Wozniak, P. J., & Daniel, W. W. (1991) · Technometrics · doi:10.2307/1268795 · Cited by 5,008
Valiant, L. G. (1984) · ACM eBooks · doi:10.1145/3749740.3749746 · Cited by 4,211
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
(2013) · Springer eBooks · Cited by 2,625
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553
Practical Nonparametric Statistics
Conover, W. J. (1971) · Cited by 1,477
Practical Nonparametric Statistics
Obremski, T. E., & Conover, W. J. (1981) · Technometrics · doi:10.2307/1268234 · Cited by 1,429
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90114-1 · Cited by 1,054
Inferring decision trees using the minimum description lenght principle
Quinlan, J. R., & Rivest, R. L. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90010-2 · Cited by 650
An Empirical Comparison of Pruning Methods for Decision Tree Induction
Mingers, J. (1989) · Machine Learning · doi:10.1023/a:1022604100933 · Cited by 628
Minimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
Quinlan, J. R. (1999) · International Journal of Human-Computer Studies · doi:10.1006/ijhc.1987.0321 · Cited by 272
Learning decision rules in noisy domains
Niblett, T., & Ivan Bratko, A. (1987) · Cited by 175
On estimating probabilities in tree pruning
Cestnik, B., & Ivan Bratko, A. (1991) · Lecture notes in computer science · doi:10.1007/bfb0017010 · Cited by 162
Expert Systems—Rule Induction with Statistical Data
Mingers, J. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.5 · Cited by 155
ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS
Pearl, J. (1978) · International Journal of General Systems · doi:10.1080/03081077808960690 · Cited by 98
(1991) · Lecture notes in computer science · doi:10.1007/bfb0016999 · Cited by 91
LEARNING CLASSIFICATION RULES USING BAYES
Buntine, W. (1989) · Elsevier eBooks · doi:10.1016/b978-1-55860-036-2.50033-3 · Cited by 68
Reduced complexity rule induction
Weiss, S. M., & Indurkhya, N. (1991) · Cited by 62
When does overfitting decrease prediction accuracy in induced decision trees and rule sets?
Schaffer, C. (1991) · Lecture notes in computer science · doi:10.1007/bfb0017014 · Cited by 25
Self-citationSparse data and the effect of overfitting avoidance in decision tree induction
Schaffer, C. (1992) · Cited by 24
Self-citationInduction with randomization testing: decision-oriented analysis of large data sets
Jensen, D. D. (1992) · Cited by 22
Deconstructing the Digit Recognition Problem
Schaffer, C. (1992) · Elsevier eBooks · doi:10.1016/b978-1-55860-247-2.50056-5 · Cited by 17
Self-citationInduction with randomization testing (dissertation)
Jensen, D. D. (1993) · ACM SIGART Bulletin · doi:10.1145/152941.152943 · Cited by 2
Flagged first, then by citations
Research works printed but not linked: 2
- Breiman, L., Friedman, J., Olshen, R., amp; Stone, C. (1984). Classification andRegression Trees. Pacific Grove,CA: Wadsworth amp; Brooks.
- Holte, R.C. (1991). Very simple classification rules perform well on most datasets(Technical Report TR-91-16).Ottawa, Canada: University of Ottawa, Department of Computer Science.
Cited by
Sorted by citations
The use of the area under the ROC curve in the evaluation of machine learning algorithms
Bradley, A. P. (1997) · Pattern Recognition · doi:10.1016/s0031-3203(96)00142-2 · Cited by 7,217
Chapelle, O., Schölkopf, B., & Zien, A. (2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,642
Feature Selection for Classification
Dash, M., & Liu, H. (1997) · Intelligent Data Analysis · doi:10.1016/s1088-467x(97)00008-5 · Cited by 3,594
The class imbalance problem: A systematic study1
Japkowicz, N., & Stephen, S. (2002) · Intelligent Data Analysis · doi:10.3233/ida-2002-6504 · Cited by 3,295
Very Simple Classification Rules Perform Well on Most Commonly Used Datasets
Holte, R. C. (1993) · Machine Learning · doi:10.1023/a:1022631118932 · Cited by 1,800
Metadata
- Authors
- Schaffer, C.
- Affiliations
- City University of New York (US)
- Corresponding author
- Schaffer, Cullen
- Venue
- Machine Learning
- Published
- 1993-02
- Volume
- 10
- Issue
- 2
- Pages
- 153-178
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1995023359
- Cited by
- 310
- References
- 29
- Citations by year
- 2026: 2 · 2025: 7 · 2024: 10 · 2023: 12 · 2022: 12 · 2021: 29 · 2020: 19 · 2019: 11 · 2018: 6 · 2017: 7 · 2016: 5 · 2015: 3 · 2014: 2 · 2013: 1 · 2012: 5
- FWCI
- 62.52
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Machine Learning (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
- Keywords
- overfitting avoidance, decision tree induction, selective pruning, bias-variance trade-off, prediction accuracy, generalization
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
