Keywords
Tree (set theory)PruningComputer scienceDecision treeMeasure (data warehouse)Reliability (semiconductor)Artificial intelligenceData miningMachine learningSet (abstract data type)Incremental decision treeMathematicsPattern recognition (psychology)Decision tree learning
Affiliated Institutions
Related Publications
Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy
Feature selection is an important problem for pattern classification systems. We study how to select good features according to the maximal statistical dependency criterion base...
Approximate Splitting for Ensembles of Trees using Histograms
Recent work in classification indicates that significant improvements in accuracy can be obtained by growing an ensemble of classifiers and having them vote for the most popular...
Bagging, boosting, and C4.S
Breiman's bagging and Freund and Schapire's boosting are recent methods for improving the predictive power of classifier learning systems. Both form a set of classifiers that ar...
Best-first Decision Tree Learning
Decision trees are potentially powerful predictors and explicitly represent the structure of a dataset. Standard decision tree learners such as C4.5 expand nodes in depth-first ...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 3
- Issue
- 4
- Pages
- 319-342
- Citations
- 462
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
462
OpenAlex
Cite This
John Mingers
(1989).
An Empirical Comparison of Selection Measures for Decision-Tree Induction.
Machine Learning
, 3
(4)
, 319-342.
https://doi.org/10.1023/a:1022645801436
Identifiers
- DOI
- 10.1023/a:1022645801436