On an Improved SPRINT Data Stream Online Classification Algorithm

Article Preview

Abstract:

Aiming at the characteristics of data stream, the paper presents an incremental decision tree algorithm based on binary-attribute tree on the basis of SPRINT algorithm. The attribute set of this improved algorithm adopts the maximum entropy attribute classification and dynamic storage method of Bayesian method. By using this improved algorithm, static organization form of candidate attributes set for traditional SPRINT algorithm has been changed and it is much more suitable for concept drift and reduces the time complexity for new sampling insertion and best division node selection as well as saves storage space and increases classification efficiency.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 712-715)

Pages:

2648-2652

Citation:

Online since:

June 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] C.Y. Fu, H. Zeng, H.J. Wang and J.S. Liu: ICCDA 2010,(2010), p.1193

Google Scholar

[2] M. M. Gaber, S. Krishnaswamy and A. Zaslavsky: High Efficiency Silicon Solar Cells, edited by S. Badhyopadhyay, U. Maulik, L. Holder, D. Cook, S. Verlag and M.A. Green, Trans. Tech. Publishers (1987)

Google Scholar

[3] G.V. KassAn: Applied Statistics Vol. 29(1980), p.119

Google Scholar

[4] M. Mehta, R. Agrawal and J. Rissanen: SLIQ: A fast scalable classifier for data mining[A]. In Proc. 1996 Int. Conf. Extending Database Technology (EDBT's96) [C], Avignon, France(1996).

DOI: 10.1007/bfb0014141

Google Scholar