A scalable boosting learner for multi-class classification using adaptive sampling

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Scalability has become an increasingly critical issue for successful data mining applications in the "big data" era in which extremely huge data sets render traditional learning algorithms infeasible. Among various approaches to scalable learning, sampling techniques can be exploited to address the issue of scalability. This paper presents our study on applying a newly developed sampling-based boosting learning method for multi-class (non-binary) classification. Preliminary experimental results using bench-mark data sets from the UC-Irvine ML data repository confirm the efficiency and competitive prediction accuracy of the proposed adaptive boosting method for the multi-class classification task. We also show a formulation of using a single ensemble of non-binary base classifiers with adaptive sampling for multi-class problems. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Chen, J. (2014). A scalable boosting learner for multi-class classification using adaptive sampling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8610 LNCS, pp. 61–72). Springer Verlag. https://doi.org/10.1007/978-3-319-09912-5_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free