| 增量决策树算法及复杂度分析 |
| |
| 引用本文： | 尹阿东,宫雨,吴胜利,武森,高学东,李拥军.增量决策树算法及复杂度分析[J].北京科技大学学报,2004,26(2):202-205. |
| |
| 作者姓名： | 尹阿东 宫雨 吴胜利 武森 高学东 李拥军 |
| |
| 作者单位： | 北京科技大学管理学院,北京,100083 |
| |
| 摘 要： | 介绍了增量决策树算法的基本原理,并从实例费用和信息熵费用两个角度出发,对增量决策树算法的复杂度进行分析.通过实例说明,增量决策树算法能够构造出与ID3算法形态基本相同的决策树.
|
| 关 键 词： | 决策树 增量算法 复杂度 增量 决策树 算法 复杂度分析 Complexity Decision Trees Inducing 形态 构造 信息熵 基本原理 |
| 修稿时间： | 2002年6月10日 |
An Incremental Alogrithm for Inducing Decision Trees and Its Complexity |
| |
| YIN Adong,GONG Yu,WU Shengli,WU Sen,GAO Xuedong,LI Yongjun
Management School,University of Science and Technology Beijing,Beijing ,China.An Incremental Alogrithm for Inducing Decision Trees and Its Complexity[J].Journal of University of Science and Technology Beijing,2004,26(2):202-205. |
| |
| Authors: | YIN Adong GONG Yu WU Shengli WU Sen GAO Xuedong LI Yongjun
Management School University of Science and Technology Beijing Beijing China |
| |
| Institution: | YIN Adong,GONG Yu,WU Shengli,WU Sen,GAO Xuedong,LI Yongjun
Management School,University of Science and Technology Beijing,Beijing 100083,China |
| |
| Abstract: | An incremental algorithm for inducing decision trees is presented based on ID3 algorithm. The complexity of the incremental algorithm is analyzed in terms of instance-count additions and e-score calculations. The same training instance shows that the incremental algorithm can induce decision trees equivalent to those forms by ID3 algorithm. |
| |
| Keywords: | decision trees incremental algorithm complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
