An Improved SPRINT Algorithm

Zhi Kang Luo; Huai Ying Sun; De Wang

doi:10.4028/www.scientific.net/AMR.532-533.1685

Paper Titles

A Particle Swarm Optimization Algorithm Based on the Pattern Search Method
p.1664

A New Algorithm of Video Key Frame Extraction Based on the Block of Frame Image
p.1670

Research on Data Mining Based on Apriori Algorithm
p.1675

An Algorithms for Super-Resolution Reconstruction of Video Based on Spatio-Temporal Adaptive
p.1680

An Improved SPRINT Algorithm
p.1685

Research on Algorithm of Function Set Mining Based on Interests
p.1691

Application of Chaotic Encryption Algorithm in RFID Secure Mechanism
p.1695

Study on Moving Object Detection Algorithm in Outdoor Video Surveillance System
p.1700

A New Hybrid Image Reconstruction Algorithm for Magnetic Induction Tomography
p.1706

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 532-533An Improved SPRINT Algorithm

An Improved SPRINT Algorithm

Abstract:

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 algorithm's 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.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 532-533)

Pages:

1685-1690

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.532-533.1685

Citation:

Cite this paper

Online since:

June 2012

Authors:

Zhi Kang Luo, Huai Ying Sun, De Wang

Keywords:

C4.5 Algorithm, Classification, Decision Tree, SPRINT Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Jiawei Han, Micheline Kamber. Data Ming Concepts and Techniques[M]. Fan Ming, Meng Xiaofeng, et al. Beijing: China Machine Press, 2001, pp.3-20.

Google Scholar

[2] John Shafer J，Agrawal R，Mehta M. SPRINT：A scalable parallel classifier for data mining[C]. Proceedings of the 1996 International Conference. Very Large Data Bases. Bombay，India, 1996, pp.544-555, doi: ISBN: 1-55860-382-4.

Google Scholar

[3] Shao Fengjing, Yu Zhongqing. Principle and Algorithm of Data Mining[M]. Beijing: China WaterPower Press, (2003).

Google Scholar

[4] Wei Hongning. Study on the parallelism of decision tree classification based on SPRINT[J]. Computer Applications. vol. 25, Jan. 2005, pp.40-41, doi: cnki: ISSN: 1001-9081. 0. 2005-01-012.

Google Scholar

[5] Qu Shifu, Wan Wanggen, Liu Weixiao, Wang Rui. The research of a new tax assessment model[C]. IET International Communication Conference. Wireless Mobile and Computing(CCWMC 2009). Shanghai, China, 2010, pp.429-432.

DOI: 10.1049/cp.2009.1982

Google Scholar

[6] Yu Lei, Liu Dayou, Gao Ying, Tian Ye. Improved SPRINT algorithm and its research under distributed environment[J]. Journal of Jilin University (science edition), vol. 46, Nov. 2008, pp.1119-1124, doi: CNKI: SUN: JLDX. 0. 2008-06-027.

Google Scholar

[7] Chen Ruyun, Fu Baplong. Study and application of on the parallelism of SPRINT[J]. Market Modernization, vol. 20, July. 2007, pp.13-14, doi: CNKI: SUN: SCXH. 0. 2007-20-009.

Google Scholar

[8] Liu Youjun, Wang Linlin. Improvement of SPRINT algorithm[J]. Computer Engineering, vol. 32 , Aug. 2006, , pp.55-57. doi: cnki: ISSN: 1000-3428. 0. 2006-16-020.

Google Scholar

[9] Luo Ke, Zhang Xuemao. SPRINT algorithm and its Improved Method[J]. Computer Engineering and Applications, 2005. 32, pp.178-189, doi: cnki: ISSN: 1002-8331. 0. 2005-32-055.

Google Scholar