J4

• 计算机科学 • 上一篇    下一篇

改进SPRINT算法及其在分布式环境下的研究

于 蕾, 刘大有, 高 滢, 田 野   

  1. 吉林大学 计算机科学与技术学院, 长春 130012
  • 收稿日期:2008-03-29 修回日期:1900-01-01 出版日期:2008-11-26 发布日期:2008-11-26
  • 通讯作者: 刘大有

Improved SPRINT Algorithm and Its Research under Distributed Environment

YU Lei, LIU Dayou, GAO Ying, TIAN Ye   

  1. College of Computer Science and Technology, Jilin University, Changchun 130012, China
  • Received:2008-03-29 Revised:1900-01-01 Online:2008-11-26 Published:2008-11-26
  • Contact: LIU Dayou

摘要: 通过引入一种动态数据结构, 解决了SPRINT算法使用多个属性列表存储数据、 占用过多系统资源、 需创建哈希表对属性列表进行分割以及节点分割处理相对复杂的问题, 并探讨了改进算法在分布式环境下的工作过程. 实验结果表明, 改进的算法减少了属性列表占用的存储空间以及分割节点操作所需的时间.

关键词: 决策树, SPRINT算法, 分布式环境

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.

Key words: decision tree, SPRINT algorithm, distributed environment

中图分类号: 

  • TP301