| 基于IF-THEN规则的决策树裁剪算法 |
| |
| 引用本文： | 张晓龙,骆名剑.基于IF-THEN规则的决策树裁剪算法[J].计算机应用,2005,25(9):1986-1988. |
| |
| 作者姓名： | 张晓龙 骆名剑 |
| |
| 作者单位： | 武汉科技大学计算机科学与技术学院 |
| |
| 基金项目： | 教育部留学回国人员科研启动基金;湖北省教育厅重点项目（2004D006） |
| |
| 摘 要： | 决策树是机器学习和数据挖掘领域中一种基本的学习方法。文中分析了C4.5算法以及该算法不足之处,提出了一种决策树裁剪算法,其中以规则信息量作为判断标准。实验结果表明这种方法可以提高最终模型的预测精度,并能够很好克服数据中的噪音。
|
| 关 键 词： | 决策树 树裁剪 规则信息量 |
| 文章编号： | 1001-9081（2005）09-1986-03 |
| 收稿时间： | 2005-03-12 |
| 修稿时间： | 2005-03-122005-05-28 |
Decision tree pruning algorithm with IF-THEN rules |
| |
| ZHANG Xiao-long,LUO Ming-jian.Decision tree pruning algorithm with IF-THEN rules[J].journal of Computer Applications,2005,25(9):1986-1988. |
| |
| Authors: | ZHANG Xiao-long LUO Ming-jian |
| |
| Affiliation: | College of Computer Science & Technology,Wuhan University of Science and Technology,Wuhan Hubei 430081,China |
| |
| Abstract: | Decision tree is a basic learning method in machine learning and data mining. An algorithm was presented to prune a decision tree with a set of rules that are converted from C4.5, where rule information was used as a pruning criterion. The empirical results demonstrate that the proposed pruning algorithm has high predict accuracy and good noise-tolerance. |
| |
| Keywords: | decision tree tree pruning rule information |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
