The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A further comparison of splitting rules for decision-tree induction
Open accessAbstract
One approach to learning classification rules from examples is to build decision trees. A review and comparison paper by Mingers (Mingers, 1989) looked at the first stage of tree building, which uses a “splitting rule” to grow trees with a greedy recursive partitioning algorithm. That paper considered a number of different measures and experimentally examined their behavior on four domains. The main conclusion was that a random splitting rule does not significantly decrease classificational accuracy. This note suggests an alternative experimental method and presents additional results on further domains. Our results indicate that random splitting leads to increased error. These results are at variance with those presented by Mingers.
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
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,522
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 20,825
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
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553
Clark, P., & Niblett, T. (1989) · Machine Learning · doi:10.1007/bf00116835 · Cited by 2,267
Self-citationIncremental learning from noisy data
Schlimmer, J. C., & Granger, R. H. (1986) · Machine Learning · doi:10.1007/bf00116895 · Cited by 653
An empirical comparison of selection measures for decision-tree induction
Mingers, J. (1989) · Machine Learning · doi:10.1007/bf00116837 · Cited by 561
Weiss, S. M., & Kapouleas, I. (1989) · Cited by 465
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Geurts, P., Ernst, D., & Wehenkel, L. (2006) · Machine Learning · doi:10.1007/s10994-006-6226-1 · Cited by 9,300
Decision tree classification of land cover from remotely sensed data
Friedl, M. A., & Brodley, C. E. (1997) · Remote Sensing of Environment · doi:10.1016/s0034-4257(97)00049-7 · Cited by 1,542
An introduction to decision tree modeling
Myles, A. J., Feudale, R. N., Liu, Y., Woody, N. A., & Brown, S. D. (2004) · Journal of Chemometrics · doi:10.1002/cem.873 · Cited by 1,355
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
Murthy, S. K. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009744630224 · Cited by 991
A System for Induction of Oblique Decision Trees
Murthy, S. K., Kasif, S., & Salzberg, S. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.63 · Cited by 590
A comparative analysis of methods for pruning decision trees
Esposito, F., Malerba, D., Semeraro, G., & Kay, J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.589207 · Cited by 549
Series in Machine Perception and Artificial Intelligence
(2012) · Series in machine perception and artificial intelligence · doi:10.1142/smpai · Cited by 365
Simplifying decision trees: A survey
BRESLOW, L. A., & AHA, D. W. (1997) · The Knowledge Engineering Review · doi:10.1017/s0269888997000015 · Cited by 337
Technical note: Some properties of splitting criteria
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00117831 · Cited by 270
Metadata
- Authors
- Buntine, W., & Niblett, T.
- Venue
- Machine Learning
- Published
- 1992-01
- Volume
- 8
- Issue
- 1
- Pages
- 75-85
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1969223365
- Cited by
- 269
- References
- 18
- FWCI
- 40.23
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.