首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于主从模式的并行决策树算法研究
引用本文:吕爽,陈高云,吴晓,王鹏.基于主从模式的并行决策树算法研究[J].西南民族学院学报(自然科学版),2007,33(4):743-745.
作者姓名:吕爽  陈高云  吴晓  王鹏
作者单位:成都信息工程学院软件工程系并行计算实验室 四川成都610225(吕爽,王鹏),成都信息工程学院软件工程系 四川成都610225(陈高云),贵州大学信息工程学院 贵州贵阳550003(吴晓)
摘    要:针对对等模式下并行决策树分类算法的通信开销太大,提出了一种基于主从模式的FPM_DT并行决策树挖掘算法,此算法综合使用了横向与纵向的数据划分模型,并采用根据分支数据分布情况进行结点分组的策略.实验结果表明,它与对等模式下并行SPRINT分类算法相比,降低了通信开销,具有更好的可扩展性与加速比性能.

关 键 词:主从模式  决策树  并行  分类
文章编号:1003-2843(2007)04-0743-03
收稿时间:2007-03-24
修稿时间:2007年3月24日

Research on parallel decision tree algorithm based on master/slave mode
LU Shuang,CHEN Gao-yun,WU-Xiao,WANG Peng.Research on parallel decision tree algorithm based on master/slave mode[J].Journal of Southwest Nationalities College(Natural Science Edition),2007,33(4):743-745.
Authors:LU Shuang  CHEN Gao-yun  WU-Xiao  WANG Peng
Abstract:One of greatest problems with parallel decision tree classification algorithm based on peer-peer mode is that it has great communication costs .To solve this problem, a fast scalable parallel decision tree classification algorithm based on master/slave mode named FPM_DT is proposed in this paper. It is the first algorithm to introduce several kinds of techniques such as partitioning the training datasets horizontally and vertically, partitioning the training datasets in each branch into groups according to the status of datasets distributed. Experimental results show that this algorithm has lower communication and I/O costs, better scaleup and speedup than parallel SPRINT algorithm based on peer-peer mode.
Keywords:master/slave mode  decision tree  parallel  classification
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号