Abstract
Genetic Algorithms (GAs) are categorized as search heuristics and have been broadly applied to optimization problems. These algorithms have been used for solving problems in many applications, but it has been shown that simple GA is not able to effectively solve complex real world problems. For proper solving of such problems, knowing the relationships between decision variables which is referred to as linkage learning is necessary. In this paper a linkage learning approach is proposed that utilizes the special features of the decomposable problems to solve them. The proposed approach is called Local Optimums based Linkage Learner (LOLL). The LOLL algorithm is capable of identifying the groups of variables which are related to each other (known as linkage groups), no matter if these groups are overlapped or different in size. The proposed algorithm, unlike other linkage learning techniques, is not done along with optimization algorithm; but it is done in a whole separated phase from optimization search. After finding linkage group information by LOLL, an optimization search can use this information to solve the problem. LOLL is tested on some benchmarked decomposable functions. The results show that the algorithm is an efficient alternative to other linkage learning techniques.
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
Audebert, P., Hapiot, P.: Effect of powder deposition. J. Electroanal. Chem. 361, 177 (1993)
Newman, J.: Electrochemical Systems, 2nd edn. Prentice-Hall, Englewood Cliffs (1991)
Hillman, A.R.: Electrochemical Science and Technology of Polymers, vol. 1, ch. 5. Elsevier, Amsterdam (1987)
Miller, B.: Geelong, Vic. J. Electroanal. Chem. 168, 19–24 (1984)
Jones: Personal Communication (1992)
Pelikan, M., Goldberg, D.E.: Escaping hierarchical traps with competent genetic algorithms. In: Genetic and Evolutionary Computation Conference, GECCO, pp. 511–518 (2001)
Pelikan, M., Goldberg, D.E.: A hierarchy machine: Learning to optimize from nature and humans. Complexity 8(5) (2003)
Pelikan, M.: Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, Heidelberg (2005)
Strehl, A., Ghosh, J.: Cluster Ensembles — A Knowledge Reuse Framework for Combining Multiple Partitions. Journal of Machine Learning Research 3, 583–617 (2002)
Stuart, R., Peter, N.: Artificial Intelligence: A Modern Approach, 2nd edn., pp. 111–114. Prentice-Hall, Englewood Cliffs (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parvin, H., Minaei-Bidgoli, B., Helmi, B.H. (2011). An Innovative Linkage Learning Based on Differences in Local Optimums. In: Herrero, Á., Corchado, E. (eds) Computational Intelligence in Security for Information Systems. Lecture Notes in Computer Science, vol 6694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21323-6_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-21323-6_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21322-9
Online ISBN: 978-3-642-21323-6
eBook Packages: Computer ScienceComputer Science (R0)