Pruning belief decision tree methods in averaging and conjunctive approaches

DOI10.1016/J.IJAR.2007.02.004MaRDI QIDQ2379839zbMATH OpenOpenAlexFDO

Authors Salsabil Trabelsi, Zied Elouedi, 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

belief decision treebelief function theorydecision treepruninguncertainty

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Belief decision trees: Theoretical foundations
• scientific article; zbMATH DE number 1670576
• The improvement of reasoning methods in belief decision trees
• Averaging over decision trees
• Decision analysis using belief functions

Cites work

• A Mathematical Theory of Communication
• Application of the transferable belief model to diagnostic problems
• Belief decision trees: Theoretical foundations
• scientific article; zbMATH DE number 1670576 (Why is no real title available?)
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 41270 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• scientific article; zbMATH DE number 1269589 (Why is no real title available?)
• scientific article; zbMATH DE number 1931833 (Why is no real title available?)
• scientific article; zbMATH DE number 3271180 (Why is no real title available?)
• On the handling of continuous-valued attributes in decision tree generation
• Reasoning with imprecise belief structures
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• The transferable belief model

Cited in

(11)

• Learning from partially supervised data using mixture models and belief functions
• Averaging over decision trees
• 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
• Classification systems based on rough sets under the belief function framework
• The improvement of reasoning methods in belief decision trees
• Belief decision trees: Theoretical foundations
• Comparing linear discriminant analysis and supervised learning algorithms for binary classification -- a method comparison study

Describes a project that uses

Uses Software

• C4.5

This page was built for publication: Pruning belief decision tree methods in averaging and conjunctive approaches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379839)