摘要
该文讨论了信息量或熵构造判定树的数据挖掘算法,阐明了算法中如何处理高分枝属性、数据清理及剪枝等关键环节,并说明了具体实现方法。
An algorithm for data mining based on information entropy decision_tree is introduced in this paper.The keys such as high -branching,numberic attribute,data cleaning and pruning are analysed.The classification method of big sample is presented in this paper.In the end the research and implementation for algorithm is given.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第23期180-182,213,共4页
Computer Engineering and Applications
基金
湖南省科委项目(编号:011030020105)
关键词
数据挖掘
判定树
信息增益
信息熵
Data mining,Decision_tree,Information gain,Information entropy