Fifty years of classification and regression trees
WY Loh - International Statistical Review, 2014 - Wiley Online Library
Fifty years have passed since the publication of the first regression tree algorithm. New
techniques have added capabilities that far surpass those of the early methods. Modern …
techniques have added capabilities that far surpass those of the early methods. Modern …
Decision trees: a recent overview
SB Kotsiantis - Artificial Intelligence Review, 2013 - Springer
Decision tree techniques have been widely used to build classification models as such
models closely resemble human reasoning and are easy to understand. This paper …
models closely resemble human reasoning and are easy to understand. This paper …
On distributed fuzzy decision trees for big data
A Segatori, F Marcelloni… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Fuzzy decision trees (FDTs) have shown to be an effective solution in the framework of fuzzy
classification. The approaches proposed so far to FDT learning, however, have generally …
classification. The approaches proposed so far to FDT learning, however, have generally …
Improving the precision of classification trees
WY Loh - The Annals of Applied Statistics, 2009 - JSTOR
Besides serving as prediction models, classification trees are useful for finding important
predictor variables and identifying interesting subgroups in the data. These functions can be …
predictor variables and identifying interesting subgroups in the data. These functions can be …
Soft decision trees
We discuss a novel decision tree architecture with soft decisions at the internal nodes where
we choose both children with probabilities given by a sigmoid gating function. Our algorithm …
we choose both children with probabilities given by a sigmoid gating function. Our algorithm …
A linear multivariate binary decision tree classifier based on K-means splitting
A novel linear multivariate decision tree classifier, Binary Decision Tree based on K-means
Splitting (BDTKS), is presented in this paper. The unsupervised K-means clustering is …
Splitting (BDTKS), is presented in this paper. The unsupervised K-means clustering is …
A review and experimental comparison of multivariate decision trees
L Cañete-Sifuentes, R Monroy… - IEEE Access, 2021 - ieeexplore.ieee.org
Decision trees are popular as stand-alone classifiers or as base learners in ensemble
classifiers. Mostly, this is due to decision trees having the advantage of being easy to …
classifiers. Mostly, this is due to decision trees having the advantage of being easy to …
Classifying very-high-dimensional data with random forests of oblique decision trees
The random forests method is one of the most successful ensemble methods. However,
random forests do not have high performance when dealing with very-high-dimensional …
random forests do not have high performance when dealing with very-high-dimensional …
Improved decision tree construction based on attribute selection and data sampling for fault diagnosis in rotating machines
This paper presents a new approach that avoids the over-fitting and complexity problems
suffered in the construction of decision trees. Decision trees are an efficient means of …
suffered in the construction of decision trees. Decision trees are an efficient means of …
Incremental construction of classifier and discriminant ensembles
We discuss approaches to incrementally construct an ensemble. The first constructs an
ensemble of classifiers choosing a subset from a larger set, and the second constructs an …
ensemble of classifiers choosing a subset from a larger set, and the second constructs an …