Abstract
In cooperative interactive genetic algorithms, each user evaluates all individuals in every generation through human-machine interface, which makes users tired. So population size and generation are limited. That means nobody can evaluate all individuals in search space, which leads to the deviation between the users’ best-liked individual and the optimal one by the evolution. In order to speed up the convergence, implicit knowledge denoting users’ preference is extracted and utilized to induce the evolution. In the paper, users having similar preference are further divided into a group by K-means clustering method so as to share knowledge and exchange information each other. We call the group as knowledge alliance. The users included in a knowledge alliance vary dynamically while their preferences are changed. Taken a fashion evolutionary design system as example, simulation results show that the algorithm speeds up the convergence and decreases the number of individuals evaluated by users. This can effectively alleviate users’ fatigue.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Takagi, H.: Interactive evolutionary computation: fusion of the capabilities of EC optimization and human evaluation. Proceedings of the IEEE 89(9), 1275–1296 (2001)
Guo, Y.-N., Lin, Y.: Interactive genetic algorithms with frequent-pattern mining. In: Proceedings of the 6th International Conference on Natural Computation, pp. 2381–2385 (2010)
Sun, X.-Y., Wang, X.-F., Gong, D.-W.: A distributed co-Interactive genetic algorithm and its applications to group decision-making. Information and Control 36(5), 557–561 (2007)
Miki, M., Yamamoto, Y., Wake, S.: Global asynchronous distributed interactive genetic algorithm. In: 2006 IEEE International Conference on Systems, Man and Cybernetics, pp. 3481–3485 (2006)
Hiroyasu, T., Yokouchi, H.: Extraction of Design Variables using Collaborative Filtering for Interactive Genetic Algorithms. In: IEEE International Conference on Fuzzy Systems, pp. 1579–1584. IEEE, Piscataway (2009)
Guo, Y.-N., Lin, Y., Yang, M., Zhang, S.: User’s preference aggregation based on parallel interactive genetic algorithms. Applied Mechanics and Materials Journal 34, 1159–1164 (2010)
Wang, J.P., Chen, H., Xu, Y., et al.: An architecture of agent-based intelligent control systems. In: Proceedings of the World Congress on Intelligent Control and Automation, pp. 404–407. IEEE, Piscataway (2000)
Le, M.N., Ong, Y.S.: A frequent pattern mining algorithm for understanding genetic algorithms. In: International Conference on Natural Computation, pp. 131–139. IEEE, Piscataway (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, Yn., Zhang, S., Cheng, J., Lin, Y. (2011). Cooperative Interactive Cultural Algorithms Based on Dynamic Knowledge Alliance. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23896-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-23896-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23895-6
Online ISBN: 978-3-642-23896-3
eBook Packages: Computer ScienceComputer Science (R0)