How To Escape Traps Using Clonal Selection Algorithms PDF
How To Escape Traps Using Clonal Selection Algorithms PDF
JASON BROWNLEE
Technical Report 070209A
Complex Intelligent Systems Laboratory, Centre for Information Technology Research,
Faculty of Information Communication Technology, Swinburne University of Technology
Melbourne, Australia
jbrownlee@ict.swin.edu.au
Abstract-Inspired by Darwins theory of natural selection to In brief, the principle of the theory is that the antigen
explain the diversity and adaptability of life, Burnets clonal (the foreign molecule that the immune system is
selection theory explains the diversity and learning properties of defending against) selects those lymphocytes (B-cells or
the acquired immune system of vertebrates. In a similar white blood cells that detect and stop antigens) with
mirroring manner to the field of evolutionary computation that receptors capable of reacting with a part of the antigen.
attempts to use the principles of the Darwinian theory and Selection results in the rapid proliferation of the selected
genetics to address practical engineering problems, a new field of cell to combat the invasion (clonal expansion and
study called Clonal Selection Algorithms has emerged that production of antibodies). During this cell duplication
attempts the same task by abstracting and applying the process coping errors occur (somatic hypermutation)
principles of Burnets foundational immunological theory. This which may result in an improved affinity of the progeny
paper provides a summary of this new field of clonal selection cells receptors for the triggering antigen.
algorithms and proposes an algorithm taxonomy, a standardized
This description clearly sounds like a selective and
nomenclature, and a general model of such algorithms. Finally,
stochastic-based adaptive process. This general method
the field is compared and contrasted to the field of evolutionary
has inspired the field of clonal selection algorithms
computation, and general research trends are discussed.
which attempt to harness its potential in the application
Keywords- Clonal Selection Algorithm, CSA, Clonal Selection
to primarily optimization and classification problem
Theory, Clonal Selection Principle, Artificial Immune System, domains.
Algorithm Review, CLONALG, AIRS, BCA, MISA, IA The paper is broken down as follows; Section II
presents a general model of clonal selection algorithms
I. INTRODUCTION which includes a standard definition, specification of
Artificial Immune Systems (AIS) is the investigation algorithmic principles, and a standardized nomenclature.
of models and abstractions of the vertebrate (typically Also presented is a high-level algorithm taxonomy for
mammalian) immune system and the application of these interpreting the current state of the art in clonal selection
models and algorithms to practical endeavours such algorithms. Section III applies the taxonomy from
computation problem domains in the fields of science, section II.C and reviews the field of clonal selection
engineering, and information technology [88]. Although algorithms. This review is complete1 and focuses on
the source of inspiration for computational models in the applications and general algorithmic principles. Section
immune system is near limitless, four main sub fields of IV addresses the clear similarity between clonal
research have emerged in AIS cantered on prominent selection algorithms and some evolutionary algorithms,
immunological theories; negative selection algorithms contrasting the two related fields of research. Finally V
(NSA), immune network algorithms (INA), danger general trends observed from the literature review are
theory algorithms (DTA), and clonal selection discussed, and some potential future areas for clonal
algorithms (CSA). selection algorithm design are suggested.
Like Darwin s theory of theory of accumulated blind II.GENERAL MODEL
variation in the face of natural selection that
revolutionized the field of biology [19], Burnet s theory The clonal selection theory is the foundational
(inspired by Darwin s) of clonal selection suitably principle of modern immunology, thus it is tightly
explains the laboratory observations of antibody interconnected with other immunological theories. This
diversity in the acquired immune system and follows for the algorithms inspired by such theories. For
transformed modern immunology [43-45]. A discussion example, negative selection algorithms model
of Burnet s theory is beyond the scope of this work (for a classification problems in the complement space
modern introduction see [13,112,153]), although it is not although still rely on the clonal selection principle to
the theory that is relevant, but rather the computational iteratively improve exemplars. Immune network
principles that can be drawn. Thus, it is popular in the algorithms for clustering and optimization use the
field of clonal selection algorithms to describe the excitation and suppression properties of the network
inspiration as the clonal selection principle as opposed
C.Taxonomy
A.Nomenclature
Before an algorithm taxonomy is presented, it is
Given that inspiration is such a critical feature to this useful to present a brief taxonomy of the broader field of
field of study, it is important to have a consistent research. As stated in the introduction the term chosen
nomenclature when describing clonal selection for the field of study is Clonal Selection Algorithms
algorithms. This nomenclature is drawn from the (CSA) inspired by the Clonal Selection Principle (CSP)
biological inspiration and refers to the principles which is derived from the Clonal Selection Theory
mimicked by inspired algorithms (see Table 1 for a (CST). The field belongs to the study of Artificial
listing of common CSA terms drawn from the literature). Immune Systems (AIS) which is commonly associated
General Clonal Selection Algorithms with Biologically-Inspired Computation (BIC) or
Candidate Solution, Exemplar Antibody, B-Cell, Lymphocyte Computational Intelligence (CI).
Collection of New Samples, Progeny Clone
Elitism, Memory Memory Set, Memory Cell A taxonomy of clonal selection algorithms has not
Generalization Cross-reactivity been presented before2, and although obvious is
Learning Principle Clonal Selection Principle expected to be useful in interpreting the current state of
Mutation, Variation Hypermutation the field. A algorithmic-genealogical approach was
Population, Collection of Samples Repertoire taken similar to that used by Galeano, Veloza-Suan, et
Re-sampling Principle, Improvement Affinity Maturation
al. [64] in the comparative analysis of artificial immune
Re-sampling, Reproduction Cloning, Clonal Expansion
Selection Antigen-Antibody Matching
network models. Here, the lineage is defined by the
Solution Quality, Fitness Affinity, Avidity seminal algorithm names, as follows; the Artificial
Immune Recognition System (AIRS), the B-Cell
Table 1 - Clonal Selection Algorithms Common Nomenclature
Algorithm (BCA), the Clonal Selection Algorithm
(CLONALG), the Immunological Algorithm family
B.Archetype Algorithm (IA), Multi-objective Immune System Algorithm
Cutello and Nicosia [144] suggest clonal selection (MISA), and Other for unclassified works (see Table 2).
algorithms take two key features into account; the Lineage Algorithms Primary
hypermutation and the clonal expansion mechanisms. Application
They go on to describe hypermutation as a local search AIRS AIRS, AIRS2, Parallel AIRS Classification
procedure that leads to fast maturation, and the clonal BCA BCA Optimization
expansion phase triggers growth of a new population of CLONALG CSA, CLONALG, CLONALG (1,2), Optimization
(CSA) ACS, CLONCLAS, RCSA, MOCSA,
useful B-cells focused on the triggering antigen. They IMCSA, AISMM, SACSA, ECA
also propose that the primary immune response may be IA (SIA) IA, SIA, I-PAES, CLIGA, CLIGA+, Optimization
taken as a training phase, whereas the improved NC-IA, READ-Alg, opt-IA, opt-
secondary response may be taken as the testing phase. IMMALG, Par-IA, Dyn-IMMALG
MISA MISA Multi-Objective
de Castro and Timmis [88] also suggest the two key Optimization
features of clonal selection algorithms are the mutation Other Too large to classify at this time Optimization
and cloning properties, and go on to outline more
Table 2 Basic algorithm genealogy
specific properties of these mechanisms ([88] page 80):
Principle 1.0: The proliferation rate of each immune cell is
proportional to its affinity with the selective antigen (higher the relative III.ALGORITHMS
affinity, the more progeny) This section presents a review of clonal selection
Principle 1.1: The mutation suffered by each immune cell during
algorithms applying the taxonomy presented in II.C.
reproduction is inversely proportional to the affinity of the cell receptor with
Sections A through to E present the five main algorithm
the antigen (higher the relative affinity, the lower the mutation)
lineages. Section F summarizes uncategorized works,
and section G summarizes those works claimed or
They also suggest that selection plays a critical role referred to be clonal selection algorithms which do not
in both the strong selective pressure during affinity meet definition 1.0.
maturation, and in the selection of long lived memory
cells.
Thus a general clonal selection algorithm possesses
the following mechanisms: 2
To the best knowledge of the authors at the time of writing.
antibodies are subjected to cloning proportional to of the immune system, Watkins, Bi, et al. [12] propose
affinity, and hypermutation of clones inversely- that each antibody in the algorithms repertoire can be
proportional to clone affinity. The resultant clonal-set treated independently given the lack of inter-antibody
competes with the antibody population for membership interactions. The pattern recognition variation of the
in the next generation, and finally low-affinity CLONALG was modified such that each memory cell is
population members are replaced by randomly generated partitioned to different processes and evolved
antibodies. The pattern recognition variation of the independently or in small groups, the results from which
algorithm includes a maintenance memory solution set are collated at the end of the algorithm run and returned
which in its entirety represents a solution. A binary- as the algorithm result3. White and Garret [54] also
encoding scheme is employed for the binary-pattern investigated the pattern recognition version of
recognition and continuous function optimization CLONALG and generalized the approach for the task of
examples, and an integer permutation scheme is binary pattern classification renaming it Clonal
employed for the Travelling Salesman Problem (TSP) Classification (CLONCLAS) where their approach was
example. compared to a number of simple Hamming distance
CLONALG Description and Pseudocode based heuristics.
Walker and Garrett [59] investigated CLONALG and
Evolution Strategies (ES) on dynamic function
optimization, showing that although CLONALG can
Parameter Description
P Repertoire of antibodies
N The fixed antibody repertoire size achieve better results faster than ES on low dimensional
n The number of antibodies to select for cloning dynamic functions, ES consistently outperforms
L Bit string length for each antibody CLONALG on the two high-dimensional problems
Nc Number of clones created by each selected antibody. tested. In an attempt to address concerns of algorithm
Originally expressed as a function of the repertoire size
efficiency, parameterization, and representation selection
(for optimization) N c = round ( N ) (where is a for continuous function optimization Garrett [122]
user parameter), although a direct integer specification proposes an updated version of CLONALG called
of Nc is simpler. A rank-based (affinity proportionate) Adaptive Clonal Selection (ACS). The mutation
variation of the question is presented for pattern
recognition. parameter, the number of antibodies selected for cloning,
d Number of random antibodies to insert at the end of and the number of clones produced for each antibody
each generation. Random antibodies replace the d lowest were changed to automatic parameters, controlled in a
affinity antibodies in the repertoire similar way to those in Evolution Strategies (ES).
Stop condition Typically a specified number of generations or function
evaluations. Cutello, Narzisi, e al. [141] proposed two modified
affinity Solution evaluation, typically the solution is decoded versions called CLONALG1 and CLONALG2 with
into a domain specific representation and assigned a varying elitist strategies which were raced against the
quality costing opt-IA algorithm. Dilettoso and Salerno [34] treated
clone Duplication of a bit string.
hypermutate Modification of a bit string where the flipping of a bit is
CLONALG as a niching technique and raced it against
governed by an affinity proportionate probability traditional EC niching approaches. Wang [157] proposed
distribution. Originally p = exp( f ) , although the a CSA based on CLONALG with a static clone sized
1
applied to power filter design observing niching like
opt-aiNET variant is also popular p = exp( f ) behaviours. Cruz-Cortes, Trejo-Perez, et al. [110]
investigated CLONALG with binary and gray encoding
(where is a user parameter and f is the normalized
In an investigation of AIS applied to optimization, attempt to introduce further diversity into the search.
Hone and Kelsey [7] provide a case study investigation These less-greedy modifications of to the achieve better
of the BCA and show apparently fractal structures on the final results compared to the classical BCA on the test
complex plain suggesting the potential usefulness of functions chosen, perhaps suggesting the use of diversity
studying AIS as nonlinear dynamical systems. In a introduction approaches in further BCA applications.
further empirical study, Timmis, Edmonds, et al. [62]
compare the BCA to opt-aiNET4 and the HGA D.Immunological Algorithm Family (IA)5
attributing the partial success of BCA to the mutation
scheme, speculating it results in the escaping of local- A simple clonal selection inspired algorithm was
optima search behaviour. proposed by Cutello and Nicosia [142,143] called
Immunological Algorithm (IA) later renamed to Simple
BCA Description and Pseudocode Immunological Algorithm (SIA) [144]. The algorithm
maintains a population of B-cells that are exposed to a
clonal expansion process each generation. This
expansion process involves the cloning of cells and the
Parameter Description
P Repertoire of antibodies
N Antibody population size application of a hypermutation operator. The algorithm
Nc Number of clones to create of each antibody was demonstrated on the Minimum Hitting Set Problem
nR Number of random antibodies to create and insert each (MHSP) and the 3-Satisifiability Problem (3-Sat).
generation
Stop Condition Typically if no progress is made for a number of The SIA was extended and an applied to the Graph
generations Colouring Problem (GCP) [146]. The extensions
hypermutation Uses a processes called contiguous hypermutation, a involved the introduction of a local-search procedure
random location in the bit string is selected, and a that operated upon each B-cell after the clonal expansion
random bub-string length is selected. Each bit in the
phase. In addition, rather than an elitist selection method
substring is flipped with the probability
EndFor
ForEach p of P Do // clonal expansion configured level as needed, and an information gain (a
C <- clone(p, Nc)
stabilization in the measure of information discovered by
the algorithm) measure was used as the termination
C <- rand(nR, L) // random insertion
ForEach c of C Do // affinity maturation
hypermutate(c) criteria for the algorithm.
The probabilistic aging operator was replaced with a
EndFor
ForEach c of C Do // presentation
affinity(c) simplified generational aging operator by Cutello,
EndFor Nicosia, et al. [148] in an application to the 2DHP
C <- best(C) protein folding problem. In a more detailed study on
P <- replace(c, p) // clonal selection
different varieties of the same protein folding domain,
the aging operator was further tweaked to facilitate
EndFor
EndWhile
Figure 3 - BCA pseudocode listing
5
The Immunological Algorithm (IA) is renamed and represented many
A proof of convergence for the BCA is proposed by
times by its authors. Other names include Simple Immune Algorithm (SIA),
Cloning Information Gain Aging (CLIGA), and Optimization Immune
4
(opt-aiNET) an immune network algorithm as specified in [87] Algorithm (opt-IA, opt-IMMALG).
compared to the traditional static approach. This Coello Coello and Cruz Cortes [18] introduce an AIS
algorithm was evaluated again in a larger study called the Multi-objective Immune System Algorithm
involving a number of machine learning domains [141], (MISA), and as its name suggests was designed as a
and again on a large number of continuous function population-based approach for constrained and
optimization instances [131]. unconstrained multi-objective optimization. In the
approach a repertoire of solutions is split into antigens
Cutello, Nicosia, et al. [147] investigate the (Pareto non-dominated and feasible solutions) and
hypermutation operators of opt-IA. Cutello, Morelli, et antibodies (Pareto dominated and infeasible solutions).
al. [138] apply opt-IA to the 3DHP protein folding A bit-string representation is used and antigens are
problem. Cutello and Nicosia [145] apply opt-IA to selected at random and matched against antibodies
graph colouring, MHSP, and satisfiability. Work by (using Hamming distance). After selection, antibodies
Anile, Cutello, et al. [3] hybridizes opt-IA with a direct are cloned and mutated the population is unioned and
search method. An extension of opt-IA called aligner reduced back to the configured size, culling the lower
was proposed by Cutello, Lee, et al. [137] applied to quality solutions. An external (elitist) memory repertoire
multiple sequence alignment of DNA. is maintained of non-dominated feasible solutions.
SIA Description and Pseudocode Solutions are added to the memory set if they are non-
dominated by the current memory set population and
sufficiently diverse as determined by a grid-based
Parameter Description maintenance structure.
P Antibody population
l Length of binary string representation MISA was extended by the same authors [109] and
d Population (repertoire) size further compared to state of the art evolutionary
dup The number of clones created for each antibody approaches for multi-objective optimization. An EC-AIS
clone Duplication of the bit string hybrid terminology was adopted and an EC-based
hypermutation Probabilistic modification of a bit string (bit flipping), crossover mechanism was adopted within the memory
requires the specification ( ) of the probability of
outlined in section II. They are listed here for although they maintain the same arguments of
completeness, although by no means is this a complete inspiration, vocabulary, and formalism and the primary
collection of ambiguous clonal selection algorithm differences.
works.
In their book de Castro and Timmis [88] again
Forrest, Javornik, et al. [123] investigated the pattern acknowledge the similarity of CLONALG to an EA.
recognition properties of the immune system. They used They are quick to point out that a major difference
a binary coded genetic algorithm (GA) to model between the inspirations of the two approaches is that
antibody-antigen matching in the immune system, which mutation in evolution is random, whereas the
included the clonal selection mechanism, claiming The hypermutation process of clonal selection is controlled
GA without crossover is a reasonable model of clonal and directed proportional to the receptors affinity with
the triggering antigen. They go on to suggest that work
GA model of somatic hypermutation of clonal selection research on selection operators (e.g. tournament, roulette
to investigate the Baldwin Effect and evolution. wheel, etc.) may be exploited. The shape-space
Weinand [114] propose a dynamical systems formalism is presented as a CSA representation
computational model of somatic mutation of B cells to abstraction and alternative representation schemes and
evaluate the affect of somatic mutation of affinity corresponding mutation mechanisms are discussed, also
maturation of the immune response. Fukuda, Mori, et al. leveraging from research from representation and
[126] and Mori, Tsukiyama, et al. [76] use a GA to mutation in EA s.
investigate clonal selection properties and immune
network algorithms for scheduling and resource de Castro and Timmis provide a treatment of
allocation. evolution and the clonal selection of the acquired
immune system. They suggest an important difference
Zhang and Hou propose a Niching Clonal Selection between the two theories is the fact that in the clonal
Algorithm (NCSA) [169] that combines negative process expansion occurs through cell cloning, that
selection and refinement using CSA applied to the there is no sex or genetic recombination, rather only
pattern matching problem of anomaly detection. Yo and affinity inversely-proportionate somatic hypermuatation.
Hou [177] proposed an extension of CLONALG called
CsAL (Clonal Selection Algorithm) to investigate the In work on the MISA Coello Coello and Cruz Cortes
negative selection approach to virus detection. Kim, [18] claim that their approach is not a genetic algorithm
because it does not use recombination (crossover
operator), they later [109] adopt a crossover procedure in
6
Many of these works could not be obtained by the author prior to the their approach, as well as adopt a hybrid EC and AIS
publication of this paper, thus general application domain was assumed in terminology.
some cases from paper abstracts
[23] David B. Fogel. Evolutionary Computation : Toward a New antibody production using the concept of clonal selection Australian Journal
Philosophy of Machine Intelligence, New Jersey, USA : John Wiley & Sons, of Science, vol. 20, pp. 67-69, 1957.
Inc. 1995. [44] Frank Macfarlane Burnet. The clonal selection theory of acquired
[24] David E. Goldberg. Genetic Algorithms in Search, Optimization immunity, Nashville, Tennessee, U.S.A.: Vanderbilt University Press, 1959.
and Machine Learning, USA, Canada: Addison Wesley Publishing [45] Frank Macfarlane Burnet, Clonal selection and after Theoretical
Company, Inc., 1989. Immunology, vol. pp. 63-85, 1978.
[25] David E. Goldberg and J. Richardson, "Genetic algorithms with [46] Gaurav Marwah and Lois Boggess, "Artificial Immune Systems for
sharing for multimodal function optimization," Proceedings of the Second classification: Some issues," First International Conference on Artificial
International Conference on Genetic Algorithms on Genetic algorithms and Immune Systems, September 2002, pp. 149-153, 2002.
their application, Cambridge, MA, USA, pp. 41-49, 1987. [47] Hai-Feng Du , Li-Cheng Jiao, and Sun-An Wang, "Clonal operator
[26] Debraj De, Sonai Ray, and Amit Konar, "A Fuzzy Based Dynamic and antibody clone algorithms," Proceedings. 2002 International Conference
Routing Algorithm: A Q-Learning Intelligent Clonal Selection Approach with on Machine Learning and Cybernetics, pp. 506-510, 2002.
SPDE Pareto," ICCI 2004: International Conference on Computational [48] Haifeng Du, Licheng Jiao, Maoguo Gong, and Ruochen Liu,
Intelligence, Istanbul; Turkey, pp. 396-399, 2004. "Adaptive Dynamic Clone Selection Algorithms," Rough Sets and Current
[27] Donald E. Goodman and Lois C. Boggess, "The role of hypothesis Trends in Computing, pp. 768-773, 2004.
filtering in (AIRS), an artificial immune classifier," Intelligent Engineering [49] Haifeng Du, Xiaoyi Jin, Jian Zhuang, Licheng Jiao, and Sun'an
Systems Through Artificial Neural Networks, pp. 243-248, 2004. Wang, "Immune Clonal Selection Network," Advances in Artificial
[28] Donald Goodman, Lois Boggess, and Andrew Watkins, "Artificial Intelligence, 17th Australian Joint Conference on Artificial Intelligence,
Immune System Classification of Multiple-Class Problems," Intelligent Cairns, Australia, pp. 840-852, 2004.
Engineering Systems through Artificial Neural Networks: Smart Engineering [50] Hang Yu, Maoguo Gong, Licheng Jiao, and Bin Zhang, "Clonal
System Design: Neural Networks, pp. 179-184, 2002. Selection Algorithm with Immunologic Regulation for Function
[29] Donald Goodman, Lois Boggess, and Andrew Watkins, "An Optimization," Computational Intelligence and Security, International
Investigation into the Source of Power for AIRS, an Artificial Immune Conference, CIS 2005, Xi'an, China, pp. 858-863, 2005.
Classification System," Proceedings of the International Joint Conference on [51] Hong-yun Meng, Xiao-hua Zhang, and San-yang Liu, "A Novel
Neural Networks (IJCNN'03), pp. 1678-1683, 2003. Clonal Selection for Multi-modal Function Optimization," Advances in
[58] Jing Wang, Xiao-hua Zhang, and Licheng Jiao, "Integrated the Novel Approach to Resource Allocation Mechanism in Artificial Immune
Simplified Interpolation and Clonal Selection into the Particle Swarm Recognition System: Fuzzy Resource Allocation Mechanism and Application
Optimization for Optimization Problems," Simulated Evolution and Learning, to Diagnosis of Atherosclerosis," Artificial Immune Systems, pp. 244-255,
pp. 433-440, 2006. 2006.
[59] Joanne H. Walker and Simon M. Garrett, "Dynamic Function [78] Kemal Polat , Seral Sahan, Halife Kodaz, and Salih G nes, "A
Optimisation: Comparing the Performance of Clonal Selection and New Classification Method for Breast Cancer Diagnosis: Feature Selection
Evolutionary Strategies," ICARIS-2003, Edinburgh, pp. 273-284, 2003. Artificial Immune Recognition System (FS-AIRS)," Advances in Natural
Computation, pp. 830-838, 2005.
[60] Johnny Kelsey, J. Timmis, and A. Hone, "Chasing chaos," The
2003 Congress on Evolutionary Computation, (CEC '03), pp. 413-419, 2003. [79] Kemal Polat , Seral Sahan, Halife Kodaz, and Salih G nes,
Ricardo Tanscheit, Marco Aur lio Cavalcanti Pacheco, and Antonio Carneiro
[82] L. Xu, M. Y. Chow, and J. Timmis. L. S. Taylor, Power
[91] Lin Hao, Maoguo Gong, Yifei Sun, and Jin Pan, "Niching Clonal Optimization Using Ideas from the Clonal Selection Principle," Proceedings,
Selection Algorithm for Multimodal Function Optimization," Advances in Part I Genetic and Evolutionary Computation Conference (GECCO 2003),
Natural Computation, Second International Conference, ICNC 2006, Xi'an, Chicago, IL, USA, pp. 158-170, 2003.
China, pp. 820-827, 2006. [110] Nareli Cruz-Cort s, Daniel Trejo-P rez, and Carlos A. Coello
[92] Lingjun Meng, Peter van der Putten, and Haiyang Wan, "A Coello, "Handling Constraints in Global Optimization using an Artificial
Comprehensive Benchmark of the Artificial Immune Recognition System Immune System," Proceedings of the 4th International Conference on
(AIRS)," Advanced Data Mining and Applications, pp. 575-582, 2005. Artificial Immune Systems (ICARIS 2005) , Banff, Alberta, Canada , pp. 234-
247, 2005.
[93] Liu Fang and Li Chaoyang, "A multiview face recognition based
on combined feature with clonal selection," Proceedings. ICSP '04. 2004 7th [111] P. Bull, A. Knowles, G. Tedesco, and A. Hone, "Diophantine
International Conference on Signal Processing, pp. 1380-1384, 2004. Benchmarks for the B-Cell Algorithm," Proceedings 5th International
Conference on Artificial Immune Systems (ICARIS 2006), Instituto
[94] Liu Fang and Zhao Jing: "An Immune Clonal Selection Scheduling
Gulbenkian de Ci ncia, Oeiras, Portugal, 2006.
Algorithm for Input-Queued Switches," Simulated Evolution and Learning,
pp. 790-797, 2006. [112] Philip Leder. The Genetics of Antibody Diversity . In:
Immunology Recognition and Response - Readings from scientific american
[95] Liu Haibo, Gu Guochang, Shen Jing, and Fu Yan, "A fast clonal magazine, ed. William E. Paul. New York: W. H. Freeman and Company,
selection algorithm for constructing an immune neural network,"
1987.pp. 20-34.
PROCEEDINGS OF THE 11TH JOINT INTERNATIONAL COMPUTER
CONFERENCE - JICC 2005, Chongqing, China, 2005. [113] Qiaoling Wang, Changhong Wang, and X. Z. Gao, "A Hybrid
Optimization Algorithm based on Clonal Selection Principle and Particle
[96] Liu Ruochen, Du Haifeng, and Jiao Licheng, "Immunity clonal
Swarm Intelligence," Sixth International Conference on Intelligent Systems
strategies," Proceedings. Fifth International Conference on Computational Design and Applications, ISDA '06. pp. 975-979, 2006.
Intelligence and Multimedia Applications, ICCIMA 2003. pp. 290-295, 2003.
[114] Richard G. Weinand, Somatic mutation, affinity maturation and
[97] Lois Boggess and Janna S. Hamaker, "The Effect of Irrelevant
the antibody repertoire: a computer model Journal of Theoretical Biology,
Features on AIRS, an Artificial Immune-Based Classifier," Intelligent vol. 143, pp. 343-382, 1990.
Engineering Systems through Artificial Neural Networks (ANNIE), pp. 219-
224, 2003. [115] Ron Hightower, Stephanie Forrest, and Alan S. Perelson, "The
Baldwin Effect in the Immune System: Learning by Somatic Hypermutation,"
[98] Ma Jie, Gao Hong-yuan, and Diao Ming, "Multiuser Detection Adaptive Individuals in Evolving Populations: Models and Algorithms, pp.
Using the Clonal Selection Algorithm and Hopfield Neural Network,"
159-167, 1995.
International Conference on Communications, Circuits and Systems
Proceedings, pp. 739-743 , 2006. [116] Ronghua Shang, Licheng Jiao, Maoguo Gong, and Bin Lu, "Clonal
Selection Algorithm for Dynamic Multiobjective Optimization,"
[99] Ma Li, Bai Lin, Jiao Li-cheng, and Chen Chang-guo, "Intrusion
Computational Intelligence and Security, International Conference, CIS 2005,
Detection Based on Adaptive Polyclonal Clustering," International
Xi'an, China, pp. 846-851, 2005.
Conference on Computational Intelligence and Security, pp. 598-603, 2006.
[117] Ruo-Chen Liu, Li-Cheng Jiao, and Hai-Feng Du, Clonal Strategy
[100] Maoguo Gong, Haifeng Du1, Licheng Jiao, and Ling Wang,
Algorithm based on the Immune Memory Journal of Computer Science and
"Immune Clonal Selection Algorithm for Multiuser Detection in DS-CDMA
Technology, vol. 20, pp. 728-734, 2005.
Systems," AI 2004: Advances in Artificial Intelligence, 17th Australian Joint
Conference on Artificial Intelligence, Cairns, Australia, pp. 1219-1225, 2004. [118] Ruochen Liu, Li Chen, and Shuang Wang, "Immune Clonal
Strategies Based on Three Mutation Methods," Advances in Natural
[101] Maoguo Gong, Licheng Jiao, Haifeng Du, Bin Lu, and Wentao
Computation, pp. 114-121, 2006.
Huang, "IFCPA: Immune Forgetting Clonal Programming Algorithm for
Large Parameter Optimization Problems," Advances in Natural Computation, [119] Ruochen Liu, Licheng Jiao, and Haifeng Du, "Adaptive immune
First International Conference, ICNC 2005, Changsha, China, pp. 826-829, clonal strategy algorithm," Proceedings. ICSP '04. 2004 7th International
2005. Conference on Signal Processing, pp. 1554-1557, 2004.
[102] Maoguo Gong, Licheng Jiao, Haifeng Du, Ronghua Shang, and [120] Samir W. Mahfoud, "A Comparison of Parallel and Sequential
Bin Lu, "Performance assessment of an artificial immune system Niching Methods," Proceedings of the Sixth International Conference on
multiobjective optimizer by two improved metrics," Proceedings of the 2005 Genetic Algorithms, pp. 136-143 , 1995.
conference on Genetic and evolutionary computation, Washington DC, USA, [121] Shuiping Gou, Licheng Jiao, Yangyang Li, and Qing Li, "Kernel
pp. 373-374, 2005. Matching Pursuit Based on Immune Clonal Algorithm for Image
[103] Maoguo Gong, Ling Wang, Licheng Jiao, and Haifeng Du, "An Recognition," Simulated Evolution and Learning, pp. 26-33, 2006.
artificial immune system algorithm for CDMA multiuser detection over multi- [122] Simon M. Garrett, "Parameter-free, adaptive clonal selection,"
path channels," Proceedings of the 2005 conference on Genetic and Congress on Evolutionary Computing (CEC 2004), Portland Oregon, USA,
evolutionary computation, Washington DC, USA, pp. 2105-2111, 2005. pp. 1052-1058, 2004.
[104] Mario Villalobos-Arias, Carlos A. Coello Coello, and On simo [123] Stephanie Forrest, Brenda Javornik, Robert E. Smith, and Alan S.
Hern ndez-Lerma, "Convergence Analysis of a Multiobjective Artificial
Perelson, Using Genetic Algorithms to Explore Pattern Recognition in the
Immune System Algorithm," Proceedings Artificial Immune Systems: Third Immune System Evolutionary Computation, vol. 1, pp. 191-211, 1993.
International Conference, ICARIS 2004, Catania, Sicily, Italy, pp. 226-235, [124] Thomas Back, David B Fogel, and Zbigniew Michalwicz.
2004. Evolutionary Computation 1 - Basic Algorithms and Operators, Bristol, UK:
[105] Meiyi Li, Zixing Cai, Yuexiang Shi, and Pingan Gao, "A Hybrid Institute of Physics (IoP) Publishing, 2000.
Immune Evolutionary Computation Based on Immunity and Clonal Selection [125] Thomas Back, David B Fogel, and Zbigniew Michalwicz.
for Concurrent Mapping and Localization," Advances in Natural Evolutionary Computation 2 - Advanced Algorithms and Operators, Bristol,
Computation, pp. 1308-1311, 2005. UK: Institute of Physics (IoP) Publishing, 2000.
[106] Melanie Mitchell and John H. Holland, "When Will a Genetic [126] Toyoo Fukuda, Kazuyuki Mori, and Makoto Tsukiyama, Immune
Algorithm Outperform Hill Climbing?," Proceedings of the 5th International networks using genetic algorithm for adaptive production scheduling 15th
Conference on Genetic Algorithms, Urbana-Champaign, IL, USA, pp. 647 , IFAC World Congress, vol. 3, pp. 57-60, 1993.
1993.
[127] Tsair-Fwu Lee, Ming-Yuan Cho, Chin-Shiuh Shieh, Hong-Jen Lee,
[107] Ming-Yuan Cho, Tsair-Fwu Lee, Shih-Wei Gau, and Ching-Nan