摘要
区间值属性单调决策树算法是处理区间值属性单调分类问题的重要途径之一,但此算法构建决策树过程中没有考虑属性间的相关性,因此极可能继续分类没有意义或意义很小的冗余属性。针对以上不足,在区间值属性单调决策树算法的基础上,分析了区间值属性之间的冗余信息对构建单调决策树的影响,并提出了一种扩展算法,要求选取的扩展属性不仅与决策属性的排序互信息值最大,还与同一分支上已被选取的条件属性的排序互信息值最小。实验结果表明,考虑了区间值属性间的交互信息后,可避免同一条件属性的重复选择,与已有的算法相比,该扩展算法能构建出更优的单调决策树。
The monotonic decision tree algorithm of interval-valued attributes is one of the important ways to deal with the classification problems with monotonicity constraints.However,the correlation between attributes is not taken into account in the process of building a decision tree,so it is very possible that over-classification of redundant attributes has little or no significance.To solve these problems,based on the monotonic decision tree algorithm of interval-valued attributes,the paper analyzes the influence of redundant information between interval-valued attributes on the construction of monotonic decision tree,and proposes an extended monotonic decision tree algorithm of interval-valued attributes.The extended attributes are selected by maximizing the value of the rank mutual information between the candidate attributes and the decision attribute and minimizing the value of the rank mutual information between the candidate attributes and the selected attributes on the same branch.The experimental results show that the extended algorithm can avoid repeated selection of the same attributes after considering the correlation among the condition attributes.Compared with the existing algorithms,the extended algorithm can construct a better monotonic decision tree.
作者
王鑫
陈建凯
翟俊海
WANG Xin;CHEN Jian-kai;ZHAI Jun-hai(College of Mathematics and Information Science,Hebei University,Baoding 071002;Hebei Province Key Laboratory in Machine Learning and Computational Intelligence,Baoding 071002,China)
出处
《计算机工程与科学》
CSCD
北大核心
2020年第3期557-563,共7页
Computer Engineering & Science
基金
河北省科技计划重点研发基金(19210310D)
河北省自然科学基金(F2017201026)
河北省社会科学基金(HB18GL010,HB19JY042)。
关键词
区间值属性
排序互信息
属性相关
单调决策树
interval-valued attribute
rank mutual information
correlation of attributes
monotonic decision tree