Keywords
PruningSmoothingBayesian probabilityArtificial intelligenceMachine learningComputer scienceTree (set theory)AlgorithmMathematicsData miningPattern recognition (psychology)
Affiliated Institutions
Related Publications
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...
CLOUDS: a decision tree classifier for large datasets
Classification for very large datasets has many practical applications in data mining. Techniques such as discretization and dataset sampling can be used to scale up decision tr...
Classification and Regression by randomForest
Recently there has been a lot of interest in “ensemble learning” — methods that generate many classifiers and aggregate their results. Two well-known methods are boosting (see, ...
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
- 1992
- Type
- article
- Volume
- 2
- Issue
- 2
- Pages
- 63-73
- Citations
- 395
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
395
OpenAlex
Cite This
Wray Buntine
(1992).
Learning classification trees.
Statistics and Computing
, 2
(2)
, 63-73.
https://doi.org/10.1007/bf01889584
Identifiers
- DOI
- 10.1007/bf01889584