4.6 Article

Evidential Decision Tree Based on Belief Entropy

期刊

ENTROPY
卷 21, 期 9, 页码 -

出版社

MDPI
DOI: 10.3390/e21090897

关键词

decision; belief entropy; Deng entropy; basic belief assignment; fuzzy data classification

资金

  1. National Natural Science Foundation of China [61573290, 61973332]

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据