Classification with boosting of extreme learning machine over arbitrarily partitioned data

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

Abstract

Machine learning-based computational intelligence methods are widely used to analyze large-scale data sets in this age of big data. Extracting useful predictive modeling from these types of data sets is a challenging problem due to their high complexity. Analyzing large amount of streaming data that can be leveraged to derive business value is another complex problem to solve. With high levels of data availability (i.e., Big Data), automatic classification of them has become an important and complex task. Hence, we explore the power of applying MapReduce-based distributed AdaBoosting of extreme learning machine (ELM) to build a predictive bag of classification models. Accordingly, (1) data set ensembles are created; (2) ELM algorithm is used to build weak learners (classifier functions); and (3) builds a strong learner from a set of weak learners. We applied this training model to the benchmark knowledge discovery and data mining data sets.

Cite

CITATION STYLE

APA

Çatak, F. (2017). Classification with boosting of extreme learning machine over arbitrarily partitioned data. Soft Computing, 21(9), 2269–2281. https://doi.org/10.1007/s00500-015-1938-4

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