A survey of distributed classification based ensemble data mining methods

Journal of Applied Sciences

Volumn 9, Issue 20, 2009, Pages 3739-3745

  Mokeddem, D ^a   Belbachir, H ^a  

^a UNIVERSITÉ DES SCIENCES ET DE LA TECHNOLOGIE D ORAN MOHAMED BOUDIAF   (Algeria)

Author keywords

Decision trees algorithm; Distributed data mining; Ensemble learning methods

Indexed keywords

DATA MINING ALGORITHM; DATA MINING METHODS; DISTRIBUTED CLASSIFICATION; DISTRIBUTED DATA MINING; ENSEMBLE LEARNING; OVERALL EFFICIENCY; PRE-DEFINED CLASS; TREES ALGORITHM;

ALGORITHMS; DECISION TREES; FORESTRY; LEARNING SYSTEMS; SURVEYS;

DATA MINING;

EID: 70349814661     PISSN: 18125654     EISSN: 18125662     Source Type: Journal    
DOI: 10.3923/jas.2009.3739.3745     Document Type: Article

References (40)

1. Aounallah, M. and M. Guy, 2007. Distributed data mining: Why do more than aggregating models. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 07), 2007, pp: 2645-2650.
2. Blake, C.L. and C.J. Merz, 1998. UCI Repository of Machine Learning Databases. 1 st Edn., Hyderabad, India University of California, Irvine, CA.
3. Bradley, P., G. Johannes, R. Raghu and S. Ramakrishnan, 2002. Scaling mining algorithms to large databases. Commun. ACM, 45: 38-43.
4. Breiman, L., 1996. Bagging predictors. Mach. Learn., 24: 123-140.
5. Breiman, L., 1999. Pasting small votes for classification in large database and on-line. Mach. Learn., 36: 85-103.
6. Breiman, L., 2001. Random forest. Mach. Learning., 45: 5-32.
7. Bryll, R., G.O. Ricardo and O. Francis, 2003. Attribute bagging: Improving accuracy of classifier ensembles by using random feature subsets. Pattern Recogn., 36: 1291-1302.
8. Chawla, N. V., S. Eschrich and L.O. Hall, 2001. Creating ensembles of classifiers. Proceedings of the IEEE International Conference on Data Mining, 2001, USA.,pp: 580-581.
9. Chawla, N.V., T.E. Moore, L.O. Hall, K.W. Bowyer, W.P. Kegelmeyer and C. Springer, 2003. Distributed learning with bagging-like performance. Pattern Recogn. Lett, 24: 455-471.
10. Chawla, N.V., O. Lawrence Hall, W. Kevin Bowyer and W. Philip Kegelmeyer, 2004. Learning ensembles from bites: A scalable and accurate approach. J. Mach. Learn. Res., 5: 421-445.
11. Dai, I., L. Joohan and C. Morgan Wang, 2005. Efficient parallel data mining for massive datasets: Parallel random forest classifier. Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), June 2005, CSREA Press, DBLP., pp: 1142-1148.
12. David Wolpert, H., 1992. Stacked generalization. Neural Networks, 5: 241-259.
13. Davies, W. and P. Edwards, 2000. Dagger: A new approach to combining multiple models learned from disjoint subsets. Machine Learning, 2000: 1-16.
14. Dietterich, T.G. and G. Thomas, 2000. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting and randomization. Mach. Learn., 40: 139-157.
15. Eschnch, S., N.V. Chawla and L.O. Hall, 2002. Learning to predict in complex biological domains. J. Syst. Simul., 2: 1464-1471.
16. Freund, Y. and E. Robert Schapire, 1995. A decision-theoretic generalization of on-line learning and an application to boosting. Proceedings of the Second European Conference on Computational Learning Theory, 1995, LNCS., pp: 23-37.
17. Freund, Y., 1995. Boosting a weak learning algorithm by majority. Inform. Comput, 121: 256-258.
18. Gehrke, J., R. Ramakrishnan and G. Venkatesh, 1998. Rainforest - a framework for fast decision tree construction of large datasets. Proceedings of the 24th International Conference on Very Large Data Bases, 1998, New York, NY, USA., pp: 416-427.
19. Kam Ho, T., 1998. The random subspace method for constructing decision forests. IEEE Trans. Pattern Anal. Mach. Intell, 20: 832-844.
20. Karnath, C. and E. Cantu-Paz, 2001. Creating ensembles of decision trees through sampling. Proceedings of the 33-rd Symposium on the Interface of Computing Science and Statistics, 2001, Costa Mesa, CA., pp:l-l.
21. Kim, Y., 2002. Convex hull ensemble machine. Proceedings of IEEE International Conference on Data Mining (ICDM), 2002, IEEE Computer Society, Maebashi City, Japan, pp: 243-249.
22. Lawrence Hall, O., C. Nitesh and W. Kevin Bowyer, 1998. Combining decision tress learned in parallel. Proceedings of the Distributed Data Mining Workshop at International Conference of Knowledge Discovery, 1998, Department of Computer Science and Engineering, pp: 1-6.
23. Lawrence Hall, O., W. Kevin Bowyer, W. Philip Kegelmeyer, E. Thomas Moore and C. Chi-ming, 2000. Distributed learning on very large data sets. Proceedings of the Workshop on Distributed and Parallel Knowledge Discovery, 2000, KDD00, pp: 79-84.
24. Lazarevic, A. and Z. Obradovic, 2002. Boosting algorithms for parallel and distributed learning. Parallel Distributed Data Mining, 11: 203-229.
25. Li, J. and L. Huiqing, 2003. Ensembles of cascading trees. Proceedings of the Third IEEE International Conference on Data Mining (ICDM'03), 2003, Melbourne, Florida, USA., pp: 1-4.
26. Liu, K., H. Kargupta and J. Ryan, 2006. Distributed data mining bibliography. Release, pp: 1-7. http://www.biostat.wustl.edu/archives/html/s-news/2003-09/msg00165.html.
27. Mehta, M., R. Agrawal and J. Rissanen, 1996. SLIQ: Afast scalable classifier for data mining. Proceedings of the Fifth International Conference on Extending Database Technology: Advances in Database Technology 1996, EDBT'06, Acadmic Press, pp: 18-32.
28. Park, B. and H. Kargupta, 2002. Distributed Data Mining: Algorithms, Systems and Applications. Data Mining Handbook, USA.
29. Perlich, C, F. Provost and J. Simonoff, 2003. Tree induction vs. logistic regression: A learning-curve analysis. J. Mach. Learn. Res., 4: 211-255.
30. Robert Duin, P.W., 2002. The Combining classifier: To train or not to train? Proceedings 16th International Conference on Pattern Recognition, 2002, Fac. of Appl. Sci., Delft Univ. of Technology, pp: 765-770.
31. Robert Shapire, E., 1990. The strength of weak learnability. Mach. Learn. J., 5: 197-227.
32. Rodriguez, J.J., L.I. Kuncheva and C.J. Alonso, 2006. Rotation forest: A new classifier ensemble method. IEEE Trans. Pattern Anal. Mach. Intell, 28:1619-1630.
33. Ross Quinlan, J., 1993. C4.5 Programs for Machine Learning. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
34. Ross Quinlan, J., 1996. Bagging, boosting and C4.5. Proceedings of the 13th National Conference on Artificial Intelligence, 1996, AAAI 96, AAAI Press, Portland, Oregon, pp: 725-730.
35. Sabine McConnell, M. and B. David Skillicorn, 2004. Building predictors from vertically distributed data. Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research CASCON'04, 2004, ACM, USA., pp: 150-162.
36. Shafer, J., R. Agarwal and M. Mehta, 1996. SPRINT: A scalable parallel classifier for data mining. Proceedings of 22nd International Conference on Very Large Databases, 1996, Mumbai, India, pp: 544-555.
37. Skillicorn, D.B. and S.M. McConnell, 2008. Distributed prediction from vertically partitioned data. J. Parallel Distributed Comput, 68: 16-36.
38. Tsai, S.T. and Y. Chao-Tung, 2004. Decision Tree construction for data mining on grid computing. Proceedings IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04), 2004, USA., pp: 441-447.
39. Yu, C. and D.B. Skillicorn, 2001. Parallelizing Boosting and Bagging. Queen's University, Kingston, Ontario, Canada.
40. Zhang, S.C., X.D. Wu and C.Q. Zhang, 2003. Multi-database mining. IEEE Comput. Intell. Bull., 2: 5-13.