| 动态决策树算法研究 |
| |
| 引用本文： | 尹阿东,谢霖铨,龙誉,杨立东.动态决策树算法研究[J].计算机工程与应用,2004,40(33):103-105,132. |
| |
| 作者姓名： | 尹阿东 谢霖铨 龙誉 杨立东 |
| |
| 作者单位： | 北京科技大学管理学院,北京,100083 |
| |
| 基金项目： | 国家自然科学基金资助项目(编号:50074005) |
| |
| 摘 要： | 该文在增量决策树算法的基础上,提出一种能够处理变化数据集的减量决策树算法,提出并证明了减量决策树算法中的三个基本定理,保证了减量决策树算法的可靠性。同时将传统的增量决策树算法与该文所提出的减量决策树算法相结合,构造出一种动态决策树算法,该算法很好地解决了发生增减变化的动态数据集构造决策树的问题,另外动态决策树算法的提出也促进了在线规则提取的发展与完善。
|
| 关 键 词： | 决策树算法 动态数据集 信息熵 |
| 文章编号： | 1002-8331-(2004)33-0103-03 |
Researches on Dynamic Algorithm of Decision Trees |
| |
| Yin Adong Xie Linquan Long Yu,Yang Lidong.Researches on Dynamic Algorithm of Decision Trees[J].Computer Engineering and Applications,2004,40(33):103-105,132. |
| |
| Authors: | Yin Adong Xie Linquan Long Yu Yang Lidong |
| |
| Abstract: | Based on the incremental algorithm,this paper proposes a new algorithm that can induce decision trees from the decreasing datasets.At the same time ,this paper also presents and testifies the three theorems that ensure the valid-ity of the decreasing algorithm.Furthermore,integrating the traditional incremental algorithm with decreasing algorithm,this paper proposes a dynamic algorithm of decision trees,which can extract rules of decision trees from the changeable datasets.The dynamic algorithm can promote the development and perfection of the On-Line Rules Extraction. |
| |
| Keywords: | algorithm of decision trees dynamic datasets expected information |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
