biology daily - the biology and biochemistry encyclopedia
biology daily articles and research Encyclopedia Dictionary Forums biology research links Weblinks Pictures Articles Blogs Newsletter

Human-based genetic algorithm

In evolutionary computation, a human-based genetic algorithm (HBGA) is a genetic algorithm that allows humans to contribute their innovative solutions to the evolutionary process. For this purpose HBGA uses human-based innovation interfaces for initialization, mutation, and crossover operators. Often HBGA uses human evaluation as well (see Interactive genetic algorithm). Actually, the first HBGA implementation [1] uses both human innovation and evaluation, and in addition, human users are free to choose the next genetic operation to perform.

Recent research suggests that human-based innovation operators are advantageous not only where it is hard to design an efficient computational mutation and/or crossover (e.g. when evolving solutions in natural language), but also in the case where good computational innovation operators are readily available, e.g. when evolving an abstract picture or colors (Cheng, 2004). In the latter case, human and computational innovation can complement each other, producing cooperative results and improving general user experience by ensuring that spontaneous creativity of users will not be lost.

Contents

Structural differences from traditional GA

  • Initialization is treated as an operator, rather than a phase of GA. This allows to start HBGA with empty population. Initialization, mutation, and crossover operators form a group of innovation operators.
  • All four genetic operators (initialization, mutation, crossover, and selection) can be delegated to humans using appropriate interfaces.
  • Choice of genetic operator may be delegated to human as well, so human is not forced to perform a particular operation at any given moment
  • Storing and sampling population remains algorithmic function
  • HBGA usually uses multiple agents to perform genetic operations, being a typical example of a multi-agent system

Functional features

  • The choice of genetic representation, a common problem of GA, in HBGA is greatly simplified, since algorithm don't have to be aware of the structure of each solution. In particular, HBGA allows a natural language to be a valid representation.
  • HBGA is a method of collaboration and knowledge exchange. It merges competence of its human users creating a kind of symbiotic human-machine intelligence (see also distributed artifiicial intelligence , public distributed artificial intelligence).
  • Human innovation is facilitated by sampling solutions from population, associating and presenting them in different combinations to a user (see creativity techniques)
  • HBGA facilitates consensus and decision making by integrating individual preferences of its users.
  • HBGA makes use of a cumulative learning idea while solving a set of problems concurrently. This allows to achieve synergy because solutions can be generalized and reused among several problems. This also facilitates identification of new problems of interest and fair-share resource allocation among problems of different importance.

Areas of application

  • Problem solving using a natural language as representation

See also

Evolutionary computation, Interactive evolutionary computation, Interactive genetic algorithm, Human-computer interaction

References

  • Cheng, Chihyung Derrick and Kosorukoff, Alex (2004), Interactive one-max problem allows to compare the performance of interactive and human-based genetic algorithms. Genetic and Evolutionary Computational Conference, GECCO-2004.
  • Kosorukoff, Alex (2000), Human-based Genetic Algorithm. Online at http://www.3form.com/hbga
  • Kosorukoff, Alex (2001), Human-based Genetic Algorithm. IEEE Transactions on Systems, Man, and Cybernetics, SMC-2001, 3464-3469.Fulltext

External links

  • [2] - Free Knowledge Exchange, a project using HBGA for collaborative solving of problems expressed in natural language.
  • [3] - Interactive one-max problem allows to compare the performance of interactive and human-based genetic algorithms.


07-14-2008 23:18:10
The contents of this article are licensed from Wikipedia.org under the GNU Free Documentation License. How to see transparent copy
BiologyDaily.com 2005. Legal info   Privacy