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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Affenzeller, M., Winkler, S.: Genetic algorithms and genetic programming: modern concepts and practical applications. Chapman & Hall/CRC (2009)
Bramlette, M.: Initialization, mutation and selection methods in genetic algorithms for function optimization. In: Proceedings of the Fourth International Conference on Genetic Algorithms, vol. 100, p. 107. Morgan Kaufmann, San Mateo (1991)
Burke, E., Newall, J., Weare, R.: Initialization strategies and diversity in evolutionary timetabling. Evolutionary Computation 6(1), 81–103 (1998)
Coello, C., Lamont, G., Van Veldhuizen, D.: Evolutionary algorithms for solving multi-objective problems. Springer-Verlag New York Inc. (2007)
Corchado, E., Abraham, A., de Carvalho, A.: Hybrid intelligent algorithms and applications. Information Sciences 180(14), 2633–2634 (2010)
Corchado, E., Graña, M., Wozniak, M.: Editorial: New trends and applications on hybrid artificial intelligence systems. Neurocomputing 75(1), 61–63 (2012)
Guerrero, J., Berlanga, A., GarcÃa, J., Molina, J.: Piecewise linear representation segmentation as a multiobjective optimization problem. Distributed Computing and Artificial Intelligence, 267–274 (2010)
Guerrero, J., GarcÃa, J., Molina, J.: Piecewise linear representation segmentation in noisy domains with a large number of measurements: the air traffic control domain. International Journal on Artificial Intelligence Tools 20(2), 367–399 (2011)
Ho, S., Chen, Y.: An efficient evolutionary algorithm for accurate polygonal approximation. Pattern Recognition 34(12), 2305–2317 (2001)
Kallel, L., Schoenauer, M.: Alternative random initialization in genetic algorithms. In: Proceedings of the 7th International Conference on Genetic Algorithms, pp. 268–275 (1997)
Keogh, E., Chu, S., Hart, D., Pazzani, M.: Segmenting time series: A survey and novel approach. Data mining in time series databases, pp. 1–21 (2003)
Krasnogor, N., Smith, J.: A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation 9(5), 474–488 (2005)
Maaranen, H., Miettinen, K., Mäkelä, M.: Quasi-random initial population for genetic algorithms*. Computers & Mathematics with Applications 47(12), 1885–1895 (2004)
Rahnamayan, S., Tizhoosh, H., Salama, M.: A novel population initialization method for accelerating evolutionary algorithms. Computers & Mathematics with Applications 53(10), 1605–1614 (2007)
Ramsey, C., Grefenstette, J.: Case-based initialization of genetic algorithms. In: Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 84–91 (1993)
Sarfraz, M.: Linear Capture of Digital Curves. In: Interactive Curve Modeling, pp. 241–265. Springer, London (2008)
Schoenauer, M.: Shape representations and evolution schemes. In: Proceedings of the Fifth Annual Conference on Evolutionary Programming, pp. 121–129 (1996)
Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)
Yin, P.Y.: A new method for polygonal approximation using genetic algorithms. Pattern Recognition Letters 19(11), 1017–1026 (1998)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C., Da Fonseca, V.: Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation 7(2), 117–132 (2003)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. In: Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, EUROGEN 2001, Athens, Greece, pp. 95–100 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guerrero, J.L., Berlanga, A., Molina, J.M. (2012). Initialization Procedures for Multiobjective Evolutionary Approaches to the Segmentation Issue. In: Corchado, E., Snášel, V., Abraham, A., Woźniak, M., Graña, M., Cho, SB. (eds) Hybrid Artificial Intelligent Systems. HAIS 2012. Lecture Notes in Computer Science(), vol 7208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28942-2_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-28942-2_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28941-5
Online ISBN: 978-3-642-28942-2
eBook Packages: Computer ScienceComputer Science (R0)