| 改进SPRINT算法及其在分布式环境下的研究 |
| |
| 引用本文： | 于蕾,刘大有,高滢,田野.改进SPRINT算法及其在分布式环境下的研究[J].吉林大学学报(理学版),2008,46(6):1119-1124. |
| |
| 作者姓名： | 于蕾 刘大有 高滢 田野 |
| |
| 作者单位： | 吉林大学 计算机科学与技术学院, 长春 130012 |
| |
| 基金项目： | 国家自然科学基金重大项目基金，国家自然科学基金，国家863高技术研究发展计划项目基金，吉林省科技发展计划重点项目基金，欧盟项目TH/Asia Lin/010 |
| |
| 摘 要： | 通过引入一种动态数据结构, 解决了SPRINT算法使用多个属性列表存储数据、 占用过多系统资源、 需创建哈希表对属性列表进行分割以及节点分割处理相对复杂的问题, 并探讨了改进算法在分布式环境下的工作过程. 实验结果表明, 改进的算法减少了属性列表占用的存储空间以及分割节点操作所需的时间.
|
| 关 键 词： | 决策树 SPRINT算法 分布式环境 |
| 收稿时间： | 2008-03-29 |
Improved SPRINT Algorithm and Its Research under Distributed Environment |
| |
| YU Lei,LIU Da-you,GAO Ying,TIAN Ye.Improved SPRINT Algorithm and Its Research under Distributed Environment[J].Journal of Jilin University: Sci Ed,2008,46(6):1119-1124. |
| |
| Authors: | YU Lei LIU Da-you GAO Ying TIAN Ye |
| |
| Institution: | College of Computer Science and Technology, Jilin University, Changchun 130012, China |
| |
| Abstract: | The SPRINT was improved by introducing a dynamic data structure so as to resolve the problems that SPRINT makes use of multiple attribute lists to store data which occupies system resources, splits were carried
out by way of establishing hash table, and the node splitting process is relatively complex. The example result shows that both the spatial complexity in attribute lists and the temporal complexity in the manipulation of split node have been decreased by the improved SPRINT. Finally, SPRINT’s working process was discussed under distributed environment. |
| |
| Keywords: | decision tree SPRINT algorithm distributed environment |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
