Interactive Evolutionary Computation: a survey of existing theory (2002)

Aus de_evolutionary_art_org
Version vom 19. November 2014, 12:29 Uhr von Gbachelier (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „ == Reference == Semet, Y.: Interactive Evolutionary Computation: a survey of existing theory (2002). == DOI == http://citeseerx.ist.psu.edu/viewdoc/summary?…“)

(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu: Navigation, Suche


Reference

Semet, Y.: Interactive Evolutionary Computation: a survey of existing theory (2002).

DOI

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.7832

Abstract

A literature survey of non applicative research is conducted on all attempts that have been made to enhance the design of Interactive Evolutionary Algorithms (IEAs) by theoretical means. Emphasis is put on theory and builds over the exhaustive application oriented survey made by Takagi [36]. After having positioned the study in its background and described the only attempt of mathematical modelling that was made [28], previous work is inventoried in the three main, up to now explored, directions of research: enhancing the system’s interface, allowing the user to actively participate in the search and boosting the search itself.

Extended Abstract

Bibtex

Used References

[1] P.J. Bentley and U.-M. O’Reilly. Ten steps to make a perfect creative evolutionary design system. Proceedings of GECCO, 2001.

[2] F. Boschetti and H. Takagi. Visualization of ec landscape to accelerate ec conversion and evaluation of its effect. Congress on Evolutionary Compu- tation (CEC2001), Seoul, Korea., 2001.

[3] C. L. Bridges and D. E. Goldberg. An analysis of reproduction and crossover in a binary-coded genetic algorithm. Genetic algorithms and their application: Proceedings of the Second International Conference on Genetic Algorithms, 1987.

[4] C. Caldwell and V.S. Johnston. Tracking a criminal suspect through face- space with a genetic algorithm. 4th International Conference on Genetic Algorithms (ICGA’91), San Diego, CA., 1991.

[5] P. D. Cuesta and al. Practical modeling of simple genetic algorithms, via deterministic paths, by absorbing markov chains. Proceedings of GECCO 2000, 2000.

[6] R. Dawkins. The Blind Watchmaker. Essex, U.K.:Longman, 1986.

[7] K.A. De Jong. An analysis of the behavior of a calaa of genetic adaptive systems. PhD thesis, University of Michigan, 1975.

[8] D. E. Goldberg. Genetic algorithms and simulated annealing, chapter Sim- ple genetic algorithms and the minimal, deceptive problem. London: Pit- man., 1987.

[9] D. E. Goldberg and C. L. Bridges. An analysis of a reordering operator on a ga-hard problem. Biological Cybernetics, 62, 1990.

[10] D. E. Goldberg and P. Segrest. Finite markov chain analysis with genetic algorithms. Proceedings of the 1987 International Conference on Genetic Algorithms and Their Application, 1987.

[11] N. Hayashida and H. Takagi. Visualized iec : Interactive evolutionary com- putation with multidimensional data visualization. Industrial Electronics, Control and Instrumentation (IECON2000), Nagoya Japan., 2000.

[12] M. Herdy. Evolution strategies with subjective selection. International Conference on Evolutionary Computation (ICEC/PPSN IV), Berlin, Ger- many., 1996.

[13] M. Herdy. Evolutionary optimization based on subjective selection - evolv- ing blends of coffee. 5th European Congress on Intelligent Techniques and Soft Computing EUFIT’97, Aachen, Germany., pages 640–644, 1997.

[14] N. Honda and F. Sugimoto. Multivariate data classification by face pattern considering psychometrical distance of facial expression/. Behaviormetrika, (21):29–43, 1987.

21[15] T. Ingu and H. Takagi. Accelerating ga convergence by fitting a single-peak function. IEEE International Conference on Fuzzy Systems, Seoul, Korea., 1999.

[16] Kemeny and Snell. Finite Markov chains. Princeton: Van Nostrand Rhein- hold.

[17] H.S. Kim and S.B. Cho. An efficient genetic algorithm with less fitness evaluation by clustering. pages 887–894. Proceedings of the 2001 IEEE Congress on Evolutionary Computation, Seoul, Korea, 2001.

[18] T. Kohonen. Self Organizing Maps. Springer Verlag, Heidelberg., 1995.

[19] J.B. Kruskal. Nonmetric multidimensional scaling; a numerical method. Psychometrika, (29):115–129, 1072.

[20] J.Y. Lee and S.B. Cho. Sparse fitness evaluation for reducing user burden in interactive genetic algorithm. pages 998–1003. Proceedings of the 1999 IEEE Congress on Fuzzy Systems, Seoul, Korea, 1999.

[21] A.E. Nix and M.D. Vose. Modelling genetic algorithms with markov chains. Annals of Mathematics and Artificial Intelligence, 1992.

[22] M. Ohsaki and H. Takagi. Improvement of presenting interface by pre- dicting the evaluation order to reduce the burden of human interactive ec operators. pages 1284–1289. Proceedings of the 1998 IEEE International Conference in System, Man and Cybernetics (SMC’98), San Diego, CA, 1998.

[23] U.-M. O’Reilly and Ramachandran G. A preliminary Investigation of Evo- lution as a Form Design Strategy - Artificial Life VI, pages 443–447. MIT PRESS, 1998.

[24] I.C. Parmee. Evolutionary and Adaptive Computing in Engineering Design. Springer Verlag, 2001.

[25] A. Paz. Introduction to probabilistic automata. Academic Press, New York and London, 1971.

[26] M. Rattray. Modelling the Dynamics of Genetic Algorithms using Statisit- ical Mechanics (PhD Dissertation). PhD thesis, Manchester University, UK., 1996.

[27] F. Raynal, E. Lutton, P. Collet, and Schoenauer M. Manipulation of non- linear ifs attractors using genetic programming. Congress on Evolutionary Computation (CEC’99), Washington, D.C., 1999.

[28] G. Rudolph. On interactive evolutionary algorithms and stochastic mealy automata. pages 218–226, 1196.

[29] J.D. Schaffer, L.J. Caruana, R.A.and Eshelman, and R. Das. A study of control parameters affecting online performance of gas for function optimization. In 3rd Inernational Conference on Genetic Algorithms (ICGA’89), San Mateo, CA, 1989. Morgan Kaufmann Publishers.

[30] Y. Semet, E. Lutton, and P. Collet. Artificial ant colonies and e-learning : optimization of pedagogical path. Submitted to HCI’03, 2002.

[31] Y. Semet, U.-M. O’Reilly, and F. Durand. Interactive artificial ant colonies and evolutionary computation for non photorealistic rendering. Work in Progress, 2002.

[32] R.N. et al.(Eds.) Shepard. Multidimensional Scaling; Theory and Applica- tion in the Behavioural Sciences, volume 2. Seminar Press, 1972.

[33] K. Sims. Artificial evolution for computer graphics. ACM SIGGRAPH Conference Proceedings, 1991.

[34] F. Sugimoto and M. Yoneyama. Robustness against instability of sensory judgment in a human interface to draw a facial image using a psychometri- cal space model. IEEE International Conference on Multimedia and Expo. (ICME’2000), New York, New York., 2000.

[35] H. Takagi. Active user intervention in an ec search. 5th joint Conference on Information Sciences (JCIS2000), Atlantic City, NJ., pages 995–998, 2000.

[36] H. Takagi. Interactive evolutionary computation: fusion of the capabilities of ec optimization and human evaluation. Proceedings of the IEEE, 89:1275 – 1296, Sept. 2001.

[37] H. Takagi and Kishi K. On-line knowledge embedding for an interactive ec-based montage system. 3rd International Conference on Knowledge Based Intelligent Information Engineering Systems (KES’99). Adelaide, Australia., pages 280–283, 1999.

[38] H. Takagi and K. Ohya. Discrete fitness values for improving the human interface in an interactive GA. pages 109–112, Piscataway, NJ, 1996. IEEE Service Center.

[39] T. Unemi. Sbart 2.4 : Breeding 2d cg images and movies and creating a type of collage. 3rd International Conference on Knowledge-Based Intelligent Information Engineering Systems (KES799), Adelaide, Australia., 1999.

Links

Full Text

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.108.7832&rep=rep1&type=pdf

intern file

Sonstige Links