Fusing Fuzzy Monotonic Decision Trees

IEEE Transactions on Fuzzy Systems(2020)

引用 27|浏览52
暂无评分
摘要
Ordinal classification is an important classification task, in which there exists a monotonic constraint between features and the decision class. In this article, we aim to develop a method of fusing ordinal decision trees with fuzzy rough-set-based attribute reduction. Most of the existing attribute reduction methods for ordinal decision tables are based on the dominance rough set theory or significance measures. However, the crisp dominance relation is difficult in making full use of the information of attribute values; and the reducts based on significance measures are poor in interpretability and may contain unnecessary attributes. In this article, we first define a discernibility matrix with fuzzy dominance rough set. With this discernibility matrix, multiple reducts can be found, which provide multiple complementary feature subspaces with original information. Then, diverse ordinal trees can be established from these feature subspaces, and finally, the trees are fused by majority voting. The experimental results show that the proposed fusion method performs significantly better than other fusion methods using dominance rough set or significance measures.
更多
查看译文
关键词
Rough sets,Decision trees,Heuristic algorithms,Task analysis,Uncertainty,Big Data,Entropy
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要