Combining one-vs-one decomposition and ensemble learning for multi-class imbalanced data

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

Abstract

Learning from imbalanced data poses significant challenges for machine learning algorithms, as they need to deal with uneven distribution of examples in the training set. As standard classifiers will be biased toward the majority class there exist a need for specific methods than can overcome this single-class dominance. Most of works concentrated on binary problems, where majority and minority class can be distinguished. But a more challenging problem arises when imbalance is present within multi-class datasets, as relations between classes tend to complicate. One class can be a minority class for some, while a majority for others. In this paper, we propose an efficient method for handling such scenarios that combines the problem decomposition with ensemble learning. According to divide-and-conquer rule, we decompose our multi-class data into a number of binary subproblems using one-versus-one approach. To each simplified task we delegate a ensemble of classifiers dedicated to binary imbalanced problems. Then using a dedicated classifier fusion approach, we reconstruct the original multi-class problem. Experimental analysis backed-up with statistical testing clearly proves that such an approach is superior to state-of-the art ad hoc and decomposition methods used in the literature.

Cite

CITATION STYLE

APA

Krawczyk, B. (2016). Combining one-vs-one decomposition and ensemble learning for multi-class imbalanced data. In Advances in Intelligent Systems and Computing (Vol. 403, pp. 27–36). Springer Verlag. https://doi.org/10.1007/978-3-319-26227-7_3

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