CLUSTERING WITH EVOLUTION STRATEGIES

被引:88
作者
BABU, GP
MURTY, MN
机构
[1] Department of Computer Science and Automation, Indian Institute of Science, Bangalore
关键词
HARD CLUSTERING; FUZZY CLUSTERING; OPTIMAL PARTITION; EVOLUTION STRATEGIES;
D O I
10.1016/0031-3203(94)90063-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The applicability of evolution strategies (ESs), population based stochastic optimization techniques, to optimize clustering objective functions is explored. Clustering objective functions are categorized into centroid and non-centroid type of functions. Optimization of the centroid type of objective functions is accomplished by formulating them as functions of real-valued parameters using ESs. Both hard and fuzzy clustering objective functions are considered in this study. Applicability of ESs to discrete optimization problems is extended to optimize the non-centroid type of objective functions. As ESs are amenable to parallelization, a parallel model (master/slave model) is described in the context of the clustering problem. Results obtained for selected data sets substantiate the utility of ESs in clustering.
引用
收藏
页码:321 / 329
页数:9
相关论文
共 20 条
[1]  
ANDERBERG MR, 1973, CLUSTER ANAL APPLICA
[2]   A NEAR-OPTIMAL INITIAL SEED VALUE SELECTION IN K-MEANS ALGORITHM USING A GENETIC ALGORITHM [J].
BABU, GP ;
MURTY, MN .
PATTERN RECOGNITION LETTERS, 1993, 14 (10) :763-769
[3]  
BABU GP, IN PRESS INDIAN J PU
[4]  
BEZBEK JC, 1983, PATTERN RECOGNITION
[6]  
CHIEN Y, 1978, INTERACTIVE PATTERN
[7]  
Duda R. O., 1973, PATTERN CLASSIFICATI, V3
[8]  
Dunn J. C., 1973, Journal of Cybernetics, V3, P32, DOI 10.1080/01969727308546046
[9]  
Herdy Michael, 1990, PARALLEL PROBLEM SOL, P188, DOI [10.1007/BFb0029751, DOI 10.1007/BFB0029751]
[10]  
HOFFMEISTER F, 1992, SYS192 U DORTM DEP C