Jump to content

Clonal selection algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jasonb05 (talk | contribs) at 21:52, 27 November 2008 (Basic outline of clonal selection algorithms as a stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) โ† Previous revision | Latest revision (diff) | Newer revision โ†’ (diff)


In Artificial Immune Systems, Clonal Selection Algorithms are a class of algorithms inspired by the clonal selection theory of acquired immunity that explains how B and T lymphocytes improve their response to antigens over time called affinity maturation. These algorithms focus on the Darwinian attributes of the theory where selection is inspired by the affinity of antigen-antibody interactions, reproduction is inspired by cell division, and variation is inspired by somatic hypermutation. Clonal selection algorithms are most commonly applied to optimization and pattern recognition domains, some of which resemble parallel hill climbing and the genetic algorithm without the recombination operator [1].

See also

Notes

  1. ^ de Castro, L. N. (2002). "Learning and Optimization Using the Clonal Selection Principle" (PDF). IEEE Transactions on Evolutionary Computation, Special Issue on Artificial Immune Systems. 6 (3). IEEE: 239โ€“251. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)