会议专题

An Improved SPRINT Algorithm

  This paper presents an improved SPRINT algorithm.The original SPRINT algorithm is a scalable and parallelizable decision tree algorithm,which is a popular algorithm in data mining and machine learning communities.To improve the algorithms efficiency,we propose an improved algorithm.Firstly,we select the splitting attributes and obtain the best splitting attribute from them by computing the information gain ratio of each attribute.After that,we calculate the best splitting point of the best splitting attribute.Since it avoids a lot of calculations of other attributes,the improved algorithm can effectively reduce the computation.

classification decision tree SPRINT algorithm C4.5 algorithm

Zhikang Luo Huaiying Sun De Wang

Department of information The first peoples hospital of Shunde Foshan, China Department of Computer Science College of Information Science & Technology Jinan UniversityGuangzhou School of Computer Science College of Computing Georgia Institute of Technology Atlanta,United State

国际会议

2012 2nd international Conference on Materials Science and Information Technology(2012第二届材料科学与信息技术国际会议)(MSIT2012)

西安

英文

1685-1690

2012-08-24(万方平台首次上网日期,不代表论文的发表时间)