This paper presents a new clustering algorithm based on GA(Genetic Algorithm) and k-medoids algorithm. The new algorithm can not only improve the precision of clustering but also recognize isolated points. At the same time,the new algorithm may expedite the convergence of GA and save the time cost for integration with the kmedoids algorithm in GA.
郝占刚,王正欧 . 基于遗传算法和k-medoids算法的聚类新算法*[J]. 现代图书情报技术, 2006, 1(5): 44-46.
Hao Zhangang,Wang Zhengou . A New Clustering Algorithm Based on GA and K-medoids Algorithm. New Technology of Library and Information Service, 2006, 1(5): 44-46.
1朱明. 数据挖掘合肥:中国科技技术大学出版社,2002129-157
2D.B.Fogel. An introduction to simulated evolutionary optimization. IEEE Trans.(Neural Network). 1994,5(1):3-14
3J.N.Bhuyan, V.V.Raghavan, V.K.Elayavalli. Genetic algorithm for clustering with an ordered representation,in Proc. 4th Int. Conf. Genetic Algorithms. San Mateo: Morgan Kaufman, 1991.408-420
4D.R.Jones, M. A. Beltramo.Solving partitioning problems with genetic algorithms, in Proc. 4th Int. Conf. Genetic Algorithms. San Mateo: Morgan Kaufman, 1991.442-457
(下转第57页)5许勇,刘奕文,陈贺新,戴逸松.一种基于自适应遗传算法的聚类分析方法系统工程与电子技术,1997,19(9):39-43
6K.Krishna, M.Narasimha Murty. Genetic K-Means Algorithm.IEEE Transactions on systems, man, and cybernetics-partB:Cybernetics,1999,29(3):433-439
7王敞,陈增强,袁著祉.基于遗传算法的K均值聚类分析计算机科学,2003,30(2):163-164
8王小平,曹立明.遗传算法:理论、应用及软件实现西安:西安交通大学出版社,200282-131