Keywords
Decision treeArtificial intelligenceComputer scienceMachine learningBinary decision diagramSet (abstract data type)Nonparametric statisticsBinary numberTraining setDempster–Shafer theoryBinary classificationData miningRandom subspace methodPattern recognition (psychology)MathematicsSupport vector machineStatisticsAlgorithm
Affiliated Institutions
Related Publications
The random subspace method for constructing decision forests
Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Extracting support data for a given task
We report a novel possibility for extracting a small subset of a data base which contains all the information necessary to solve a given classification task: using the Support V...
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, ...
Part-Based Statistical Models for Object Classification and Detection
We propose using simple mixture models to define a set of mid-level binary local features based on binary oriented edge input. The features capture natural local structures in t...
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...
Publication Info
- Year
- 1990
- Type
- article
- Volume
- 23
- Issue
- 7
- Pages
- 757-763
- Citations
- 66
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
66
OpenAlex
Cite This
Seymour Shlien
(1990).
Multiple binary decision tree classifiers.
Pattern Recognition
, 23
(7)
, 757-763.
https://doi.org/10.1016/0031-3203(90)90098-6
Identifiers
- DOI
- 10.1016/0031-3203(90)90098-6