📑 Table of Contents▼

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]

Techniques

edit
  • CLONALG: The CLONal selection ALGorithm[2]
  • AIRS: The Artificial Immune Recognition System[3]
  • BCA: The B-Cell Algorithm[4]

See also

edit

Notes

edit
  1. ^ Brownlee, Jason. "Clonal Selection Algorithm". Clonal Selection Algorithm.
  2. ^ de Castro, L. N.; Von Zuben, F. J. (2002). "Learning and Optimization Using the Clonal Selection Principle" (PDF). IEEE Transactions on Evolutionary Computation. 6 (3): 239–251. doi:10.1109/tevc.2002.1011539. Archived from the original (PDF) on 2017-07-06.
  3. ^ Watkins, Andrew; Timmis, Jon; Boggess, Lois (2004). "Artificial Immune Recognition System (AIRS): An Immune-Inspired Supervised Learning Algorithm" (PDF). Genetic Programming and Evolvable Machines. 5 (3): 291–317. CiteSeerX 10.1.1.58.1410. doi:10.1023/B:GENP.0000030197.83685.94. S2CID 13661336. Archived from the original (PDF) on 2009-01-08. Retrieved 2008-11-27.
  4. ^ Kelsey, Johnny; Timmis, Jon (2003). "Immune Inspired Somatic Contiguous Hypermutation for Function Optimisation". Genetic and Evolutionary Computation (GECCO 2003). p. 202. CiteSeerX 10.1.1.422.515. doi:10.1007/3-540-45105-6_26.
edit

📚 Artikel Terkait di Wikipedia

Clonal selection

In immunology, clonal selection theory explains the functions of cells of the immune system (lymphocytes) in response to specific antigens invading the

Differential evolution

Differential evolution (DE) is an evolutionary algorithm to optimize a problem by iteratively trying to improve a candidate solution with regard to a

Genetic algorithm

genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA) in

Evolutionary algorithm

Evolutionary algorithms (EA) reproduce essential elements of biological evolution in a computer algorithm in order to solve "difficult" problems, at least

Memetic algorithm

computer science and operations research, a memetic algorithm (MA) is an extension of an evolutionary algorithm (EA) that aims to accelerate the evolutionary

Selection (evolutionary algorithm)

Selection is a genetic operator in an evolutionary algorithm (EA). An EA is a metaheuristic inspired by biological evolution and aims to solve challenging

Evolutionary computation

genetic algorithms. A fourth branch, genetic programming, eventually emerged in the early 1990s. These approaches differ in the method of selection, the

Crossover (evolutionary algorithm)

Crossover in evolutionary algorithms and evolutionary computation, also called recombination, is a genetic operator used to combine the genetic information