Abstract
Decision tree is widely applied in classification and recognition areas, but meanwhile it is hard to learn from evidential data with uncertainty. To solve this issue, we propose a decision tree method which can learn from uncertain data sets and guarantee a certain classification performance when handle problems with huge ignorance or uncertainty. This tree method selects attribute based on belief entropy, a kind of uncertainty measurement, which is calculated from the basic belief assignment. And especially the Evidential Expectation-Maximization algorithm is adopted to extract the distribution parameters from evidential likelihood to generate the basic belief assignment. The proposed method is an extension of decision tree based on belief entropy, which is supposed to handle problems with precise data. Some numerical experiments on Iris and Sonar data set are conducted and the experimental results suggested that the proposed tree method achieves good result on data with high-level uncertainty.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Couso Blanco, I., Sánchez Ramos, L.: Harnessing the information contained in low-quality data sources. Int. J. Approximate Reasoning 1485–1486 (2014)
Deng, Y.: Deng entropy. Chaos Solitons Fractals 91, 549–553 (2016)
Denœux, T.: Maximum likelihood from evidential data: an extension of the EM algorithm. In: Borgelt, C., et al. (eds.) Combining Soft Computing and Statistical Methods in Data Analysis. AINSC, vol. 77, pp. 181–188. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14746-3_23
Denoeux, T.: Maximum likelihood estimation from uncertain data in the belief function framework. IEEE Trans. Knowl. Data Eng. 25(1), 119–130 (2011)
Josse, J., Chavent, M., Liquet, B., Husson, F.: Handling missing values with regularized iterative multiple correspondence analysis. J. Classif. 29(1), 91–116 (2012)
Li, M., Xu, H., Deng, Y.: Evidential decision tree based on belief entropy. Entropy 21(9), 897 (2019)
Ma, L., Destercke, S., Wang, Y.: Online active learning of decision trees with evidential data. Pattern Recogn. 52, 33–45 (2016)
McLachlan, G.J., Peel, D.: Finite Mixture Models. Wiley, Hoboken (2004)
Quost, B., Denoeux, T., Li, S.: Parametric classification with soft labels using the evidential EM algorithm: linear discriminant analysis versus logistic regression. Adv. Data Anal. Classif. 11(4), 659–690 (2017)
Sutton-Charani, N., Destercke, S., Denœux, T.: Learning decision trees from uncertain data with an evidential EM approach. In: 2013 12th International Conference on Machine Learning and Applications, vol. 1, pp. 111–116. IEEE (2013)
Zhang, H., Deng, Y.: Entropy measure for orderable sets. Inf. Sci. 561, 141–151 (2021)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Gao, K., Ma, L., Wang, Y. (2021). A Classification Tree Method Based on Belief Entropy for Evidential Data. In: Denœux, T., Lefèvre, E., Liu, Z., Pichon, F. (eds) Belief Functions: Theory and Applications. BELIEF 2021. Lecture Notes in Computer Science(), vol 12915. Springer, Cham. https://doi.org/10.1007/978-3-030-88601-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-88601-1_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-88600-4
Online ISBN: 978-3-030-88601-1
eBook Packages: Computer ScienceComputer Science (R0)