Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ruochen, L., Haifeng, D., Licheng, J.: Immunity Clonal Strategy. In: Fifth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2003), pp. 290–295 (2003)
De Castro, L.N., Von Zebun, F.J.: Learning and Optimization Using the Clonal Selection Principle. IEEE Trans. on Evolutionary Computation 6(3), 239–251 (2002)
Watkins, A., Bi, X., Phadke, A.: Parallelizing an Immune-inspired Algorithm for Efficient Pattern Recognition. In: Intelligent Engineering Systems through Artificial Neural Network: Smart Engineering System Design: Neural Network, Fuzzy Logic, Evolutionary Programming, Complex Systems and Artificial Life, vol. 13, pp. 225–230. ASME Press, New York (2003)
Watkins, A., Timmis, J.: Exploiting Parallelism Inherent in AIRS, an Artificial Immune Classifier. In: Nicosia, G., Cutello, V., Bentley, P. (eds.) The 3rd International Conference on Artificial Immune Systems, pp. 427–438. Springer, Berlin (2004)
KongYu, Y., XiuFeng, W.: Research and Implement of Adaptive Multimodal Immune Evolution Algorithm. Control and Decision 20(6), 717–720 (2005)
De Castro, L.N., Von Zuben, F.J.: Learning and Optimization Using the Clonal Selection Principle. IEEE Transactions on Evolutionary Computation 6(3), 239–251 (2002)
Ada, G.L., Nossal, G.: The Clonal Selection Theory. Scientific American 257(2), 50–57 (1987)
Xiangjun, W., Dou, J., Min, Z.: A Multi-Subgroup Competition Evolutionary Programming Algorithm. Acta Electronica Sinica 11(32), 1824–1828 (2004)
Yin-sheng, L., Ren-hou, L., Weixi, Z.: Multi-modal Functions Parallel Optimization Algorithm Based on Immune Mechanism. Journal of System Simulation 2(11), 319–322 (2005)
Fukuda, T., Mori, K., Tsukiyama, M., et al.: Parallel Search for Multi-modal Function Optimization. In: Dipankar, D. (ed.) Artificial Immune Systems and Their Applications, pp. 210–220. Springer, Heidelberg (1999)
Tong, Z., Hongwei, W., Zicai, W.: Mutative Scale Chaos Optimization and its Application. Control and Decision 14(3), 285–288 (1999)
Schwefel, H.P.: Evolution and Optimum Seeking. Wiley, New York (1995)
Yan, Z., Kang, L.: The Adaptive Evolutionary Algorithms for Numerical Optimization. In: Kim, J.-H., Furuhashi, T., Yao, X. (eds.) SEAL 1996. LNCS, vol. 1285, pp. 53–60. Springer, Heidelberg (1997)
Chenzhong, L., Huihe, S.: Evolutionary Algorithms with Chaotic Mutations. Control and Decision 15(5), 557–560 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bo, C., Zhenyu, G., Zhifeng, B., Binggang, C. (2006). Parallel Chaos Immune Evolutionary Programming. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_26
Download citation
DOI: https://doi.org/10.1007/11941439_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49787-5
Online ISBN: 978-3-540-49788-2
eBook Packages: Computer ScienceComputer Science (R0)