首页 | 本学科首页   官方微博 | 高级检索  
     

挖掘类改进决策树
引用本文:黄杰晟,曹永锋.挖掘类改进决策树[J].现代计算机,2010(1):38-41.
作者姓名:黄杰晟  曹永锋
作者单位:广东工业大学计算机学院,广州510006
摘    要:现有的决策树ID3、C4.5算法是一种快速有效的经典分类算法,但其有一个不足就是无回溯的自顶向下分析.造成所得的结果往往更多的是局部最优解而不一定是全局最优解。利用挖掘类比较技术,自底向上地分析描述,完善C4.5的分类算法,并实现自顶向下和自底向上共同分析,逼近全局最优解,取得了较好的效果。

关 键 词:决策树  挖掘类  分裂属性  选择度量

Class Mining Improved Decision Tree
HUANG Jie-sheng,CAO Yong-feng.Class Mining Improved Decision Tree[J].Modem Computer,2010(1):38-41.
Authors:HUANG Jie-sheng  CAO Yong-feng
Affiliation:HUANG Jie-sheng,CAO Yong-feng(Faculty of Computer,Guangdong University of Technology,Guangzhou 510006)
Abstract:The existing decision tree ID3 and C4.5 algorithm are fast and efficient classical classification algorithms,but there is a shortage that the non-backtracking top-down analysis,and the results tend to cause more of a local optimal solution and is not necessarily the global optimal solution.Compares the use of class mining technology,bottom-up analysis and improves C4.5 classification algorithm and to realizes top-down and bottom-up co-analysis,close to the global optimal solution,and achieves good results.
Keywords:Decision Tree  Mining Class  Split Attribute  Select Measure  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号