Bagging decision trees on data sets with classification noise

Authors:
Joaquín Abellán;Andrés R. Masegosa
Affiliations:
Department of Computer Science and Artificial Intelligence, University of Granada, Spain;Department of Computer Science and Artificial Intelligence, University of Granada, Spain
Venue:
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Year:
2010

Citing 13
Cited 0

Simplifying decision trees

International Journal of Man-Machine Studies - Special Issue: Knowledge Acquisition for Knowledge-based Systems. Part 5
C4.5: programs for machine learning

C4.5: programs for machine learning
Bagging predictors

Machine Learning
An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization

Machine Learning
Random Forests

Machine Learning
Induction of Decision Trees

Machine Learning
Maximum of entropy for credal sets

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
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
An introduction to the imprecise Dirichlet model for multinomial data

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many of the real applications of supervised classification techniques, the data sets employed to learn the models contains classification noise (some instances of the data set have wrong assignations of the class label), principally due to deficiencies in the data capture process. Bagging ensembles of decision trees are considered to be one of the most outperforming supervised classification models in these situations. In this paper, we propose Bagging ensemble of credal decision trees, which are based on imprecise probabilities, via the Imprecise Dirichlet model, and information based uncertainty measures, via the maximum of entropy function. We remark that our method can be applied on data sets with continuous variables and missing data. With an experimental study, we prove that Bagging credal decision trees outperforms more complex Bagging approaches in data sets with classification noise. Furthermore, using a bias-variance error decomposition analysis, we also justify the performance of our approach showing that it achieves a stronger and more robust reduction of the variance error component.