2017 IEEE Symposium Series on Computational Intelligence (SSCI) 2017
DOI: 10.1109/ssci.2017.8285340
|View full text |Cite
|
Sign up to set email alerts
|

Recent advances in clonal selection algorithms and applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 17 publications
(14 citation statements)
references
References 92 publications
0
14
0
Order By: Relevance
“…CSA is an evolutionary algorithm, inspired by the natural phenomenon of the biological immune system, which defends the body against external microorganisms. [ 42 ] reviewed recent works by researchers implementing CSA into their proposed network to deal with constraint optimization tasks, such as pattern recognition [ 43 ], scheduling [ 44 ], fault detection [ 45 ] and dynamic optimization [ 46 ]. Mechanisms of CSA gives the inspiration of specific cells to recognize specific antigens which are later selected to proliferate.…”
Section: Introductionmentioning
confidence: 99%
“…CSA is an evolutionary algorithm, inspired by the natural phenomenon of the biological immune system, which defends the body against external microorganisms. [ 42 ] reviewed recent works by researchers implementing CSA into their proposed network to deal with constraint optimization tasks, such as pattern recognition [ 43 ], scheduling [ 44 ], fault detection [ 45 ] and dynamic optimization [ 46 ]. Mechanisms of CSA gives the inspiration of specific cells to recognize specific antigens which are later selected to proliferate.…”
Section: Introductionmentioning
confidence: 99%
“…FCSA Input: N (the size of the population), n (the number of antibodies selected for cloning), n c (the number of clones), m (the degree of variation), c (Rac1 protein activity threshold) Output: the best antibody (1) Begin (2) Randomly generate N antibodies to form the initial candidate set (3) while not meet algorithm termination conditions do (4) Calculate the affinity Aff ab i of each antibody for antigen in the candidate set and record antibody survival time T ab i (5) Sort the antibodies in the candidate set according to their affinity, and put the best n antibodies into the antibody set Ab s (6) forab i inAb s (7) Update the value of the appropriate memory of antibody ab i : S ab i + � 1. See CLONING METHOD, clone antibody ab i according to n c and Aff ab i , and put all antibodies obtained by cloning into antibody set Ab c (8) end for (9) forab i inAb c (10) See VARIATION METHOD, according to the degree of variation m and the affinity of the antibody for the antigen Aff ab i to mutate ab i (11) if antibody ab i is a variant antibody (12) e ab i survival time T ab i � 0, e appropriate memory intensity S ab i � 1 (13) end if (14) end for (15) Select the N antibodies with the highest antigen affinity in Ab c and Ab to replace the N antibodies in Ab (16) See FORGETTING METHOD, calculate the Rac1 protein activity of each antibody in Ab according to the ratio of T ab i to S ab i (17) if antibody ab i Rac1 protein activity > threshold (18) forget the antibody ab i (19)…”
Section: Resultsmentioning
confidence: 99%
“…e classical clonal selection algorithm has problems of algorithm efficiency, convergence rate, and lack of sufficient theoretical support [12]. erefore, people use the cloning selection algorithm to solve practical problems but also put forward many useful improvements to the algorithm itself.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In this study, an evolutionary algorithm inspired by the clonal selection theory called CSA is proposed to solve the problem of univariate financial time series prediction. This algorithm is chosen because based on a survey by Luo and Lin [20], CSA has been applied to many optimization problems, including constrained optimization [21], combinatorial optimization [22], and nonlinear optimization [23]. Furthermore, according to Hu, Sun, Nie, Li, and Liu [24], CSA is less complicated than GA because it does not have crossover operation which reduces the computational cost.…”
Section: Introductionmentioning
confidence: 99%