Investigation of the importance of the genotype–phenotype mapping in information retrieval
Inhaltsverzeichnis
Referenz
J.L. Fernández-Villacañas, M. Shackleton: Investigation of the importance of the genotype–phenotype mapping in information retrieval. Future Generation Computer Systems, 19 (2003), pp. 55–68
DOI
http://dx.doi.org/10.1016/S0167-739X(02)00108-5
Abstract
An investigation of the role of the genotype–phenotype mapping (G-Pm) is presented for an evolutionary optimization task. A simple genetic algorithm (SGA) plus a mapping creates a new mapping genetic algorithm (MGA) that is used to optimize a Boolean decision tree for an information retrieval task, with the tree being created via a relatively complex mapping. Its performance is contrasted with that of a genetic programming algorithm, British Telecom Genetic Programming (BTGP) which operates directly on phenotypic trees. The mapping is observed to play an important role in the time evolution of the system allowing the MGA to achieve better results than the BTGP. We conclude that an appropriate G-Pm can improve the evolvability of evolutionary algorithms.
Extended Abstract
Bibtex
@article{FernándezVillacañasMartín200355,
title = "Investigation of the importance of the genotype–phenotype mapping in information retrieval ",
journal = "Future Generation Computer Systems ",
volume = "19",
number = "1",
pages = "55 - 68",
year = "2003",
note = "Selected papers of the 29th \{SPEEDUP\} workshop on distributed computing and high-speed networks, 22-23 March 2001, Bern, Switzerland ",
issn = "0167-739X",
doi = "http://dx.doi.org/10.1016/S0167-739X(02)00108-5",
url = "http://www.sciencedirect.com/science/article/pii/S0167739X02001085 http://de.evo-art.org/index.php?title=Investigation_of_the_importance_of_the_genotype–phenotype_mapping_in_information_retrieval",
author = "José-Luis Fernández-Villacañas Martín and Mark Shackleton",
keywords = "Genotype–phenotype mapping",
keywords = "Information retrieval",
keywords = "Genetic algorithms",
keywords = "Genetic programming "
}
Used References
[1] L. Altenberg, Fitness distance correlation analysis: an instructive counterexample, in: Proceedings of the Seventh International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 1997.
[2] J.L. Fernández-Villacañas Mart´ın, BTGP and information retrieval, in: Proceedings of the Second International Conference of Adaptive Computing in Engineering Design and Control, ACEDC ’96, University of Plymouth, UK, 1996.
[3] J.L. Fernández-Villacañas Mart´ın, P. Marrow, M. Shackleton, On measuring the attributes of evolutionary algorithms: an exploration in the information retrieval domain, in: Proceedings of the International Conference on Computational Intelligence for Modelling Control and Automation, CIMCA 2001, Las Vegas, NM, USA, July 2001.
[4] W. Fontana, P. Schuster, Shaping space: the possible and the attainable in RNA genotype–phenotype mapping, Working Paper 97-11-081, Santa Fe Institute, 1996.
[5] D.E. Goldberg, Genetic Algorithms in Search, Optimisation and Machine Learning, Addison-Wesley, Reading, MA, 1989.
[6] J.H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, 1975.
[7] M. Huynen, P. Stadler, W. Fontana, Smoothness within ruggedness: the role of neutrality in adaption, in: Proceedings of the National Academy of Sciences, USA, Vol. 93, 1996, pp. 397–401.
[8] R.E. Keller, W. Banzhaf, Genetic programming using mutation, reproduction and genotype–phenotype mapping from linear binary genomes into linear LALR(1) phenotypes, in: Proceedings of the Genetic Programming 1996, MIT Press, Cambridge, MA, 1996.
[9] D.H. Kraft, F.E. Petry, B.P. Buckles, T. Sadasivan, Genetic algorithms for query optimization in information retrieval: relevance feedback, in: E. Sanchez, T. Shibata, L.A. Zadeh (Eds.), Genetic Algorithms and Fuzzy Logic Systems, World Scientific, Singapore, 1997.
[10] M. Kimura, The Neutral Theory of Molecular Evolution, Cambridge University Press, Cambridge, 1983.
[11] J.R. Koza, Genetic Programming, MIT Press, Cambridge, MA, 1992.
[12] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin, 1994.
[13] N.R. Paterson, M. Livesey, Distinguishing genotype and phenotype in genetic programming, in: Proceedings of the Genetic Programming, MIT Press, Cambridge, MA, 1996.
[14] M. Shackleton, R. Shipman, M. Ebner, An investigation of redundant genotype–phenotype mappings and their role in evolutionary search, in: Proceedings of the 2000 Congress on Evolutionary Computation, San Diego Marriott Hotel, La Jolla, CA, Vol. 1, IEEE, 2000, pp. 493–500.
[15] R. Shipman, M. Shackleton, M. Ebner, R. Watson, Neutral search spaces for artificial evolution: a lesson from life, in: M.A. Bedau, S. Rasmussen, J.S. McCaskill, N.H. Packard (Eds.), Artificial Life: Proceedings of the Seventh International Conference on Artificial Life, MIT Press, Cambridge, MA, 2000, pp. 162–169.
[16] A. Teller, M. Veloso, Program evolution for data mining, Int. J. Expert Syst. 8 (3) (1995) 216–236.
[17] P.H. Winston, Artificial Intelligence, Addison-Wesley, Reading, MA, 1984.
Links
Full Text
