In search of optimal clusters using genetic algorithms

被引:220
作者
Murthy, CA [1 ]
Chowdhury, N [1 ]
机构
[1] RAMAKRISHNA MISSION SHILPAPITHA,CALCUTTA,W BENGAL,INDIA
关键词
pattern recognition; clustering; K-means; genetic algorithms;
D O I
10.1016/0167-8655(96)00043-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Genetic Algorithms (GAs) are generally portrayed as search procedures which can optimize functions based on a limited sample of function values. In this paper, GAs have been used in an attempt to optimize a specified objective function related to a clustering problem. Several experiments on synthetic and real life data sets show the utility of the proposed method. K-Means is one of the most popular methods adopted to solve the clustering problem. Analysis of the experimental results shows that the proposed method may improve the final output of K-Means where an improvement is possible.
引用
收藏
页码:825 / 832
页数:8
相关论文
共 15 条
[1]  
ANDERBERG M, 1973, CLUSTER ANAL APPLICA
[2]   SCENE RECOGNITION USING GENETIC ALGORITHMS WITH SEMANTIC NETS [J].
ANKENBRANDT, CA ;
BUCKLES, BP ;
PETRY, FE .
PATTERN RECOGNITION LETTERS, 1990, 11 (04) :285-293
[3]  
[Anonymous], 1982, Pattern recognition: A statistical approach
[4]  
BELEW R, 1991, P 4 INT C GEN ALG LO
[5]  
BHANDARI D, 1996, IN PRESS INT J PATTE
[6]   GENERAL ASYMMETRIC NEURAL NETWORKS AND STRUCTURE DESIGN BY GENETIC ALGORITHMS [J].
BORNHOLDT, S ;
GRAUDENZ, D .
NEURAL NETWORKS, 1992, 5 (02) :327-334
[7]  
Goldberg DE, 1989, GENETIC ALGORITHMS S
[8]  
Jain K, 1988, Algorithms for clustering data
[9]  
JOHNSON RA, 1982, APPLIED MULTIVARIATE
[10]  
MICHALEWICZ Z, 1992, GENETIC ALGORITHMS P