Decision trees using the belief function theory

This paper presents an algorithm for building decision trees in an uncertain environment. Our algorithm will use the theory of belief functions in order to represent the uncertainty about the parameters of the classification problem. Our method will be concerned with both the decision tree building task and the classification task.

[1]  Paul E. Utgoff,et al.  Incremental Induction of Decision Trees , 1989, Machine Learning.

[2]  Philippe Smets,et al.  The Transferable Belief Model , 1994, Artif. Intell..

[3]  J. R. Quinlan.  DECISION TREES AS PROBABILISTIC CLASSIFIERS , 1987 .

[4]  Philippe Smets,et al.  The Transferable Belief Model for Quantified Belief Representation , 1998 .

[5]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[6]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[7]  Philippe Smets,et al.  The Combination of Evidence in the Transferable Belief Model , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Thierry Denoeux,et al.  Reasoning with imprecise belief structures , 1999, Int. J. Approx. Reason..

[9]  Philippe Smets,et al.  Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem , 1993, Int. J. Approx. Reason..

[10]  J. Ross Quinlan,et al.  Decision trees and decision-making , 1990, IEEE Trans. Syst. Man Cybern..

[11]  P. Smets.  Application of the transferable belief model to diagnostic problems , 1998 .

[12]  Dov M. Gabbay,et al.  Handbook of defeasible reasoning and uncertainty management systems: volume 2: reasoning with actual and potential contradictions , 1998 .

[13]  Philippe Smets.  Application of the transferable belief model to diagnostic problems , 1998, Int. J. Intell. Syst..

[14]  Thierry Denux.  Reasoning with imprecise belief structures , 1999 .