摘要
文章针对决策表属性离散化改进的贪心算法在信息表中判断断点存在的缺陷,通过引入属性重要性的概念,提出了基于属性重要性的贪心算法的改进方案,弥补了原算法无法选择断点的缺陷,通过计算属性的重要性大小,优先选择属性重要的断点。
The improved greedy algorithm for discretization of decision table has its own disadvantage,that is,it can not choose the breakpoint.This paper introduces the concept of importance of attribute,and proposes a better improved greedy algorithm which compensates the above-mentioned disadvantage.The presented algorithm can choose the breakpoint with prior attribute importance by calculating the importance of attribute.
出处
《合肥工业大学学报（自然科学版）》
CAS
CSCD
北大核心
2010年第8期1185-1188,共4页
Journal of Hefei University of Technology：Natural Science
基金
国家自然科学基金资助项目(70871033)
国家高技术研究发展计划(863)资助项目(2007AA04Z116)
关键词
信息表
贪心算法
属性重要性
information table
greedy algorithm
importance of attribute
