The linkage tree genetic algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6238 LNCS, Issue PART 1, 2010, Pages 264-273

  Thierens, Dirk ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCHING POINTS; CLUSTERING PROCESS; DISTANCE MEASURE; HARD FUNCTION; HIERARCHICAL CLUSTERING ALGORITHMS; INFORMATION METRICS; NEAREST NEIGHBORS; PROBLEM REPRESENTATION; TREE NODES;

GENETIC ALGORITHMS; PROBLEM SOLVING; TREES (MATHEMATICS);

CLUSTERING ALGORITHMS;

EID: 78149244967     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15844-5_27     Document Type: Conference Paper

References (14)

1. Chen, Y.-P., Lim, M.-H. (eds.): Linkage in Evolutionary Computation. Studies in Computational Intelligence, vol. 157. Springer, Heidelberg (2008)
2. Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. In: Whitley, L.D. (ed.) Proceedings of the Second Workshop on Foundations of Genetic Algorithms, pp. 93-108. Morgan Kaufmann, San Francisco (1993)
3. Duque, T.S., Goldberg, D.E.: A new method for linkage learning in the ECGA. In: Proceedings of the 11th annual conference on Genetic and Evolutionary Computation, pp. 1819-1820. ACM, New York (2009)
4. Goldberg, D.E.: The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers, Dordrecht (2002)
5. Harik, G.R., Lobo, F.G., Sastry, K.: Linkage learning via probabilistic modeling in the extended compact genetic algorithm. In: Pelikan [9], pp. 39-61
6. Hauschild, M., Pelikan, M.: Network crossover performance on NK landscapes and deceptive problems. Technical Report MEDAL No. 2010003, Missouri Estimation of Distribution Algorithms Laboratory (January 2010)
7. Kraskov, A., Stögbauer, H., Andrzejak, R.G., Grassberger, P.: Hierarchical clustering using mutual information. EuroPhysics Letters 70(2), 278-284 (2005) (Pubitemid 40551301)
8. Pelikan, M., Sastry, K., Butz, M.V., Goldberg, D.E.: Performance of evolutionary algorithms on random decomposable problems. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 788-797. Springer, Heidelberg (2006) (Pubitemid 44609455)
9. Pelikan, M., Sastry, K., Cantú-Paz, E. (eds.): Scalable Optimization via Probabilistic Modeling. Studies in Computational Intelligence, vol. 33. Springer, Heidelberg (2006)
10. Pelikan, M., Sastry, K., Goldberg, D.E., Butz, M.V., Hauschild, M.: Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap. In: Raidl, G. (ed.) Proceedings of the 11th annual conference on Genetic and Evolutionary Computation, pp. 851-858. ACM, New York (2009)
11. Stonedahl, F., Rand, W., Wilensky, U.: Crossnet: a framework for crossover with network-based chromosomal representations. In: Proceedings of the 10th annual conference on Genetic and Evolutionary computation, pp. 1057-1064. ACM, New York (2008)
12. Thierens, D., Goldberg, D.E.: Mixing in genetic algorithms. In: Proceedings of the International Conference on Genetic Algorithms (ICGA), pp. 38-47 (1993)
13. Yu, T.-L., Goldberg, D.E.: Conquering hierarchical difficulty by explicit chunking: substructural chromosome compression. In: Cattolico, M. (ed.) Proceedings of the 8th annual conference on Genetic and Evolutionary computation, pp. 1385-1392. ACM, New York (2006)
14. Yu, T.-L., Sastry, K., Goldberg, D.E., Pelikan, M.: Population sizing for entropy-based model building in discrete estimation of distribution algorithms. In: Proceedings of the 9th annual conference on Genetic and Evolutionary Computation, pp. 601-608. ACM, New York (2007)