摘要
该文主要对数据挖掘中连续属性离散化问题进行了研究,利用系统不相容性水平和信息熵的概念提出了基于信息熵的连续属性离散化算法,并用实例对上述算法进行了分析和比较。
This paper mainly discusses continual attribute discretization algorithm of data mining.using the incompatibility level and the information entropy's concept to propose a continual attribute discretization algorithm based on the information entropy,and has carried on analysis and comparison with example to the above algorithm.
出处
《电脑知识与技术（过刊）》
2011年第1X期362-364,共3页
Computer Knowledge and Technology
关键词
离散化
信息熵
不相容水平
discretization
information entropy
incompatibility level
