Memetic evolution of classification ensembles

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

Abstract

Creating classification ensembles may be perceived as a regularization technique which aims at improving the generalization capabilities of a classifier. In this paper, we introduce a multi-level memetic algorithm for evolving classification ensembles (they can be either homo- or heterogeneous). First, we evolve the content of such ensembles, and then we optimize the weights (both for the classifiers and for different classes) exploited while voting. The experimental study showed that our memetic algorithm retrieves high-quality heterogeneous ensembles, and can effectively deal with small training sets in multi-class classification.

Cite

CITATION STYLE

APA

Piechaczek, S., Kawulok, M., & Nalepa, J. (2019). Memetic evolution of classification ensembles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11454 LNCS, pp. 299–307). Springer Verlag. https://doi.org/10.1007/978-3-030-16692-2_20

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