| Interactive Genetic Algorithms |
Article Index for Interactive |
Shopping Evolutionary |
Website Links For Interactive |
Information AboutInteractive Genetic Algorithms |
| CATEGORIES ABOUT INTERACTIVE EVOLUTIONARY COMPUTATION | |
| evolutionary algorithms | |
| interactive evolutionary computationevolutionary algorithms | |
| interactive evolutionary computation | |
| evolutionary computation | |
| evolutionary algorithms | |
| human-computer interaction | |
|
IEC DESIGN ISSUES The number of evaluations that IEC can receive from one human user is limited by user fatigue which was reported by many researchers as a major problem. In addition, human evaluations are slow and expensive as compared to fitness function computation. Hence, one-user IEC methods should be designed to converge using a small number of evaluations, which necessarily implies very small populations. Several methods were proposed by researchers to speed up convergence, like interactive constrain evolutionary search (user intervention) or fitting user preferences using a convex function (Takagi, 2001). IEC Human-computer Interface s should be carefully designed in order to reduce user fatigue. However IEC implementations that can concurrently accept evaluations from many users overcome the limitations described above. An example of this approach is an interactive media installation by Karl Sims that allows to accept preference from many visitors by using floor sensors to evolve attractive 3D animated forms. Some of these multi-user IEC implementations serve as collaboration tools, for example HBGA . IEC TYPES IEC methods include Interactive Evolution Strategy (Herdy, 1997), Interactive genetic algorithm (Caldwell, 1991), Interactive Genetic Programming (Sims, 1991; Tatsuo, 2000), and Human-based Genetic Algorithm (Kosorukoff, 2001). IGA An interactive genetic algorithm (IGA) is defined as a Genetic Algorithm that uses human evaluation. These algorithms belong to a more general category of Interactive Evolutionary Computation . The main application of these techniques include domains where it is hard or impossible to design a computational fitness function, for example, evolving images, music, various artistic designs and forms to fit a user's aesthetic preferences. Interactive computation methods can use different representations, both linear (as in traditional Genetic Algorithms ) and tree-like ones (as in Genetic Programming ). SEE ALSO
REFERENCES
EXTERNAL LINKS
|
|
|