Learning decision trees from uncertain data with an evidential EM approach

Abstract : In real world applications, data are often uncertain or imperfect. In most classification approaches, they are transformed into precise data. However, this uncertainty is an information in itself which should be part of the learning process. Data uncertainty can take several forms: probabilities, (fuzzy) sets of possible values, expert assessments, etc. We therefore need a flexible and generic enough model to represent and treat this uncertainty, such as belief functions. Decision trees are well known classifiers which are usually learned from precise datasets. In this paper we propose a methodology to learn decision trees from uncertain data in the belief function framework. In the proposed method, the tree parameters are estimated through the maximization of an evidential likelihood function computed from belief functions, using the recently proposed E2M algorithm that extends the classical EM. Some promising experiments compare the obtained trees with classical CART decision trees.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

Contributor : Sébastien Destercke <>
Submitted on : Monday, January 20, 2014 - 10:11:54 AM
Last modification on : Friday, November 16, 2018 - 9:28:01 PM
Long-term archiving on : Monday, April 21, 2014 - 1:50:10 AM


Files produced by the author(s)


  • HAL Id : hal-00933177, version 1



Nicolas Sutton Charani, Sébastien Destercke, Thierry Denoeux. Learning decision trees from uncertain data with an evidential EM approach. 12th International Conference on Machine Learning and Applications (ICMLA 2013), Dec 2013, Miami, United States. pp.1-6. ⟨hal-00933177⟩



Record views


Files downloads