Cooperative interactive cultural algorithms based on dynamic knowledge alliance

  • Authors:

  • Yi-nan Guo;Shuguo Zhang;Jian Cheng;Yong Lin

  • Affiliations:

  • College of Information and Electronic Engineering, China University of Mining and Technology, Xuzhou, Jiangsu, China;College of Information and Electronic Engineering, China University of Mining and Technology, Xuzhou, Jiangsu, China;College of Information and Electronic Engineering, China University of Mining and Technology, Xuzhou, Jiangsu, China and Department of Automation, Tinghua University, Beijing, China;College of Information and Electronic Engineering, China University of Mining and Technology, Xuzhou, Jiangsu, China

  • Venue:
  • AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part III
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.