Pruning belief decision tree methods in averaging and conjunctive approaches

Authors:
Salsabil Trabelsi;Zied Elouedi;Khaled Mellouli
Affiliations:
LARODEC, Institut Supérieur de Gestion de Tunis, 41 Avenue de la Liberté, 2000 Le Bardo, Tunis, Tunisia;LARODEC, Institut Supérieur de Gestion de Tunis, 41 Avenue de la Liberté, 2000 Le Bardo, Tunis, Tunisia;LARODEC, Institut Supérieur de Gestion de Tunis, 41 Avenue de la Liberté, 2000 Le Bardo, Tunis, Tunisia
Venue:
International Journal of Approximate Reasoning
Year:
2007

Citing 10
Cited 7

Learning decision rules in noisy domains

Proceedings of Expert Systems '86, The 6Th Annual Technical Conference on Research and development in expert systems III
Simplifying decision trees

International Journal of Man-Machine Studies - Special Issue: Knowledge Acquisition for Knowledge-based Systems. Part 5
Calculating Dempster-Shafer Plausibility

IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Handling of Continuous-Valued Attributes in Decision Tree Generation

Machine Learning
C4.5: programs for machine learning

C4.5: programs for machine learning
The transferable belief model

Artificial Intelligence
Induction of Decision Trees

Machine Learning
Possibilistic Induction in Decision-Tree Learning

ECML '02 Proceedings of the 13th European Conference on Machine Learning
Reasoning with imprecise belief structures

International Journal of Approximate Reasoning
Qualitative inference in possibilistic option decision trees

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Decision trees as possibilistic classifiers

International Journal of Approximate Reasoning
Learning from partially supervised data using mixture models and belief functions

Pattern Recognition
Constructing consonant belief functions from sample data using confidence sets of pignistic probabilities

International Journal of Approximate Reasoning
Rule discovery process based on rough sets under the belief function framework

IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Classification with dynamic reducts and belief functions

Transactions on rough sets XIV
Classification systems based on rough sets under the belief function framework

International Journal of Approximate Reasoning
Pain monitoring: A dynamic and context-sensitive system

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The belief decision tree (BDT) approach is a decision tree in an uncertain environment where the uncertainty is represented through the Transferable Belief Model (TBM), one interpretation of the belief function theory. The uncertainty can appear either in the actual class of training objects or attribute values of objects to classify. From the procedures of building BDT, we mention the averaging and the conjunctive approaches. In this paper, we develop pruning methods of belief decision trees induced within averaging and conjunctive approaches where the objective is to cope with the problem of overfitting the data in BDT in order to improve its comprehension and to increase its quality of the classification.