Evidential Decision Tree Based on Belief Entropy

Entropy

Honghui Xu¹  Mujin Li¹  Yong Deng¹ 

[1] School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, China;

关键词: decision;    belief entropy;    Deng entropy;    basic belief assignment;    fuzzy data classification;   

DOI  :  10.3390/e21090897

来源: DOAJ

【 摘 要 】

Decision Tree is widely applied in many areas, such as classification and recognition. Traditional information entropy and Pearson’s correlation coefficient are often applied as measures of splitting rules to find the best splitting attribute. However, these methods can not handle uncertainty, since the relation between attributes and the degree of disorder of attributes can not be measured by them. Motivated by the idea of Deng Entropy, it can measure the uncertain degree of Basic Belief Assignment (BBA) in terms of uncertain problems. In this paper, Deng entropy is used as a measure of splitting rules to construct an evidential decision tree for fuzzy dataset classification. Compared to traditional combination rules used for combination of BBAs, the evidential decision tree can be applied to classification directly, which efficiently reduces the complexity of the algorithm. In addition, the experiments are conducted on iris dataset to build an evidential decision tree that achieves the goal of more accurate classification.

【 授权许可】

Unknown