Asian Journal of Information Technology

Year: 2010
Volume: 9
Issue: 6
Page No. 300 - 306

A Comparative Study of Bagging, Boosting and C4.5: The Recent Improvements in Decision Tree Learning Algorithm

Authors : Subrata Pramanik, Utpala Nanda Chowdhury, Bimal Kumar Pramanik and Nazmul Huda

References

Beck, J.R., M.E. Garcia, M. Zhong, M. Georgiopoulos and G. Anagnostopoulos, 2007. A backward adjusting strategy for the C4.5 decision tree classifier. AMALTHEA REU SITE; Beck, et al. 2007. http://www.machine-learning.net/amalthea-reu.org/pubs/amalthea_tr_2007_01.pdf.

Dunham, M.H., 2004. Data Mining Introductory and Advanced Topics. Pearson Education (Singapore) Pvt. Ltd., Delhi, India.

Freund, Y. and R.E. Schapire, 1995. A decision-theoretic generalization of on-line learning and an application to boosting. Proceedings of the 2nd European Conference on Computational Learning Theory, March 13-15, 1995, Murray Hill, New Jersey, USA., pp: 23-37.

Han, J. and M. Kamber, 2007. Data Mining Concepts and Techniques. 2nd Edn., Morgan Kaufmann Publishers, San Francisco, CA., USA.

Lim, T.S., W.Y. Loh and Y.S. Shih, 2000. A comparison of prediction accuracy, complexity and training time of thirty-tree old and new classification algorithms. Machine Learn., 40: 203-228.
CrossRef  |  

Quinlan, J.R., 1986. Induction of decision trees. Mach. Learn., 1: 81-106.
CrossRef  |  

Quinlan, R.J., 1993. C4.5: Programs for Machine Learning. 2nd Edn., Morgan Kaufmann Publisher Inc., San Francisco, CA. USA., ISBN: 1-55860-238-0, pp: 302.

Ruggieri, S., 2002. Efficient C4.5. IEEE Trans. Knowledge Data Eng., 14: 438-444.
CrossRef  |  

Design and power by Medwell Web Development Team. © Medwell Publishing 2024 All Rights Reserved