DocumentCode :
2890490
Title :
Scalable Ensemble Learning by Adaptive Sampling
Author :
Jianhua Chen
Author_Institution :
Div. of Comput. Sci. & Eng., Louisiana State Univ., Baton Rouge, LA, USA
Volume :
1
fYear :
2012
fDate :
12-15 Dec. 2012
Firstpage :
622
Lastpage :
625
Abstract :
Scalability has become an increasingly critical problem for successful data mining and knowledge discovery applications in real world where we often encounter extremely huge data sets that will render the traditional learning algorithms infeasible. Among various approaches to scalable learning, sampling techniques can be exploited to address the issue of scalability. This paper presents a brief outline on how to utilize the new sampling method in [3] to develop a scalable ensemble learning method with Boosting. Preliminary experimental results using benchmark data sets from the UC-Irvine ML data repository are also presented confirming the efficiency and competitive prediction accuracy of the proposed adaptive boosting method.
Keywords :
data mining; learning (artificial intelligence); sampling methods; UC-Irvine ML data repository; adaptive boosting method; adaptive sampling; data mining; knowledge discovery; learning algorithms; sampling method; scalable ensemble learning method; Accuracy; Boosting; Computer science; Data mining; Sampling methods; Adaptive Sampling; Boosting; Ensemble Learning; Sample Size; Scalable Learning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Applications (ICMLA), 2012 11th International Conference on
Conference_Location :
Boca Raton, FL
Print_ISBN :
978-1-4673-4651-1
Type :
conf
DOI :
10.1109/ICMLA.2012.115
Filename :
6406636
Link To Document :
بازگشت