Keywords
PruningTree (set theory)Decision treeComputer scienceIncremental decision treeMachine learningMeasure (data warehouse)Artificial intelligenceData miningSet (abstract data type)Reliability (semiconductor)Decision tree learningMathematics
Affiliated Institutions
Related Publications
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 ...
An instance-weighting method to induce cost-sensitive trees
We introduce an instance-weighting method to induce cost-sensitive trees. It is a generalization of the standard tree induction process where only the initial instance weights d...
A Communication-Efficient Parallel Algorithm for Decision Tree
Decision tree (and its extensions such as Gradient Boosting Decision Trees and Random Forest) is a widely used machine learning algorithm, due to its practical effectiveness and...
Chapter 18 Committees of decision trees
Many intelligent systems are designed to sift through a mass of evidence and arrive at a decision. Certain pieces of evidence may be given more weight than others, and this may ...
A further comparison of splitting rules for decision-tree induction
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 tre...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 3
- Issue
- 4
- Pages
- 319-342
- Citations
- 312
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
312
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.1007/bf00116837
Identifiers
- DOI
- 10.1007/bf00116837