有序决策树的比较研究-计算机科学与探索-计算机工程与应用.PDF

王鑫，王熙照，陈建凯，等.有序决策树的比较研究[J].计算机科学与探索，2013 ，7（11）：1018-1025. ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@vip. 163.com Journal of Frontiers of Computer Science and Technology 1673-9418/2013/07(11)- 1018-08 Tel: +86-10 doi: 10.3778/j.issn. 1673-9418.1305014 有序决策树的比较研究 + 王 鑫 ，王熙照，陈建凯，翟俊海 河北大学 数学与计算机学院 河北省机器学习与计算智能重点实验室，河北 保定 071002 Comparative Study on Ordinal Decision Trees + WANG Xin , WANG Xizhao, CHEN Jiankai, ZHAI Junhai Key Laboratory of Machine Learning and Computational Intelligence, College of Mathematics and Computer Science, Hebei University, Baoding, Hebei 071002, China + Corresponding author: E-mail: oxinwango@ WANG Xin, WANG Xizhao, CHEN Jiankai, et al. Comparative study on ordinal decision trees. Journal of Frontiers of Computer Science and Technology, 2013, 7(11) ：1018-1025. Abstract: Ordinal classification tasks widely exist in real life. Rank entropy based ordinal decision tree is one of the most important ways of dealing with ordinal classification problems. This decision tree algorithm selects rank mutual information as a heuristic. This paper introduces fuzzy rank entropy to construct an algorithm for building a fuzzy ordinal decision tree, which is an extension of ordinal decision tree. Both of them have been applied to dispose the ordinal classification tasks in a wide range. This paper compares the two algorithms based on four aspects, and shows their comparative advantages and disadvantages. Key words: ordinal classification; fuzzy rank mutual information; ordinal decision tree 摘 要：有序分类是现实生活中广泛存在的一种分类问题。基于排序熵的有序决策树算法是处理有序分类问题 的重要方法之一，这种方法是以排序互信息作为启发式来构建有序决策树。基于这项工作