Pruning belief decision tree methods in averaging and conjunctive approaches

DOI10.1016/j.ijar.2007.02.004zbMath1185.68718MaRDI QIDQ2379839

Zied Elouedi, Salsabil Trabelsi, Khaled Mellouli

Publication date: 22 March 2010

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2007.02.004

zbMATH Keywords

uncertainty; pruning; decision tree; belief function theory; belief decision tree

Mathematics Subject Classification ID

68T37: Reasoning under uncertainty in the context of artificial intelligence

Related Items

Classification systems based on rough sets under the belief function framework, Learning from partially supervised data using mixture models and belief functions, Online active learning of decision trees with evidential data, Decision tree classifiers for evidential attribute values and class labels, Constructing consonant belief functions from sample data using confidence sets of pignistic probabilities, Parametric classification with soft labels using the evidential EM algorithm: linear discriminant analysis versus logistic regression, Classification with Dynamic Reducts and Belief Functions

Uses Software

• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• On the handling of continuous-valued attributes in decision tree generation
• The transferable belief model
• Reasoning with imprecise belief structures
• Application of the transferable belief model to diagnostic problems
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Belief decision trees: Theoretical foundations