Initialization procedures for multiobjective evolutionary approaches to the segmentation issue

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

Abstract

Evolutionary algorithms have been applied to a wide variety of domains with successful results, supported by the increase of computational resources. One of such domains is segmentation, the representation of a given curve by means of a series of linear models minimizing the representation error. This work analyzes the impact of the initialization method on the performance of a multiobjective evolutionary algorithm for this segmentation domain, comparing a random initialization with two different approaches introducing domain knowledge: a hybrid approach based on the application of a local search method and a novel method based on the analysis of the Pareto Front structure. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Guerrero, J. L., Berlanga, A., & Molina, J. M. (2012). Initialization procedures for multiobjective evolutionary approaches to the segmentation issue. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7208 LNAI, pp. 452–463). https://doi.org/10.1007/978-3-642-28942-2_41

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