Evolution and Optimum Seeking: The Sixth Generation
Evolution and Optimum Seeking: The Sixth Generation
ICCIMA '03 Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications
Learning and optimization using the clonal selection principle
IEEE Transactions on Evolutionary Computation
Parallel Chaos Search Based Incremental Extreme Learning Machine
Neural Processing Letters
Hi-index | 0.00 |
Based on Clonal Selection Theory, Parallel Chaos Immune Evolutionary Programming (PCIEP) is presented. On the grounds of antigen-antibody affinity, the original antibody population can be divided into two subgroups. Correspondingly, two new immune operators, Chaotic Clonal Operator (CCO) and Super Mutation Operator (SMO), are proposed. The former has strong search ability in the small space while the latter has better search ability in large space. Thus, combination searching local optimum with maintaining population diversity can be actualized by concurrently operating CCO and SMO. Compared with the Classical Evolutionary Programming (CEP) and Evolutionary Algorithms with Chaotic Mutations (EACM), experimental results show that PCIEP is of high efficiency and can effectively prevent premature convergence. Therefore, it can be employed to solve complicated machine learning problems.