Ensembles of decision trees based on imprecise probabilities and uncertainty measures

Authors:
JoaquíN AbelláN
Affiliations:
Department of Computer Science and Artificial Intelligence, ETS de Ingenierıas Informática y de Telecomunicación, University of Granada, 18071 Granada, Spain
Venue:
Information Fusion
Year:
2013

Citing 10
Cited 1

Bagging predictors

Machine Learning
Random Forests

Machine Learning
Induction of Decision Trees

Machine Learning
Tree Induction for Probability-Based Ranking

Machine Learning
Handling missing values in support vector machine classifiers

Neural Networks - 2005 Special issue: IJCNN 2005
Uncertainty and Information: Foundations of Generalized Information Theory

Uncertainty and Information: Foundations of Generalized Information Theory
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Statistical Comparisons of Classifiers over Multiple Data Sets

The Journal of Machine Learning Research
An Experimental Study about Simple Decision Trees for Bagging Ensemble on Datasets with Classification Noise

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Upper entropy of credal sets. Applications to credal classification

International Journal of Approximate Reasoning

Improving experimental studies about ensembles of classifiers for bankruptcy prediction and credit scoring

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an experimental comparison among different strategies for combining decision trees built by means of imprecise probabilities and uncertainty measures. It has been proven that the combination or fusion of the information obtained from several classifiers can improve the final process of the classification. We use previously developed schemes, known as Bagging and Boosting, along with a new one based on the variation of the root node via the information rank of each feature of the class variable. To this end, we applied two different approaches to deal with missing data and continuous variables. We use a set of tests on the performance of the methods analyzed here, to show that, with the appropriate approach, the Boosting scheme constitutes an excellent way to combine this type of decision tree. It should be noted that it provides good results, even compared with a standard Random Forest classifier, a successful procedure very commonly used in the literature.