A novel dynamic clustering algorithm based on immune network and tabu search

作者：Zhong J^*; Wu ZF; Wu KG; Yang QA

来源：Chinese Journal of Electronics, 2005, 14(2): 285-288.

• dynamic clustering
• immune network
• clustering feasible solution
• tabu search

It's difficult to indicate the rational number of partitions in the data set before clustering usually. The problem can't be solved by traditional clustering algorithm, such as k-means or its variations. This paper proposes a novel Dynamic clustering algorithm based on the artificial immune network and tabu search (DCBIT). It optimizes the number and the location of the clusters at the same time. The algorithm includes two phases, it begins by running immune network algorithm to find a Clustering feasible solution (CFS), then it employs tabu search to get the optimum cluster number and cluster centers on the CFS. Also, the probabilities acquiring the CFS through immune network algorithm have been discussed in this paper. Some experimental results show that new algorithm has satisfied convergent probability and convergent speed.

• 单位
  重庆大学