A hybridized approach to data clustering

被引:217
作者
Kao, Yi-Tung [1 ]
Zahara, Erwie [2 ]
Kao, I-Wei [2 ]
机构
[1] Tatung Univ, Dept Comp Sci & Engn, Taipei 104, Taiwan
[2] St Johns Univ, Dept Ind Engn & Management, Tamsui 251, Taiwan
关键词
data clustering; K-means clustering; Nelder-Mead simplex search method; Particle swarm optimization;
D O I
10.1016/j.eswa.2007.01.028
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Data clustering helps one discern the structure of and simplify the complexity of massive quantities of data. It is a common technique for statistical data analysis and is used in many fields, including machine learning, data mining, pattern recognition, image analysis, and bioinformatics, in which the distribution of information can be of any size and shape. The well-known K-means algorithm, which has been successfully applied to many practical clustering problems, suffers from several drawbacks due to its choice of initializations. A hybrid technique based on combining the K-means algorithm, Nelder-Mead simplex search, and particle swarm optimization, called K-NM-PSO, is proposed in this research. The K-NM-PSO searches for cluster centers of an arbitrary data set as does the K-means algorithm, but it can effectively and efficiently find the global optima. The new K-NM-PSO algorithm is tested on nine data sets, and its performance is compared with those of PSO, NM-PSO, K-PSO and K-means clustering. Results show that K-NM-PSO is both robust and suitable for handling data clustering. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1754 / 1762
页数:9
相关论文
共 16 条
[1]   An evolutionary technique based on K-Means algorithm for optimal clustering in RN [J].
Bandyopadhyay, S ;
Maulik, U .
INFORMATION SCIENCES, 2002, 146 (1-4) :221-237
[2]  
Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P94, DOI 10.1109/CEC.2001.934376
[3]   Hybrid simplex search and particle swarm optimization for the global optimization of multimodal functions [J].
Fan, SKS ;
Liang, YC ;
Zahara, E .
ENGINEERING OPTIMIZATION, 2004, 36 (04) :401-418
[4]  
HOOKE R, 1961, J ACM, V8, P212, DOI 10.1145/321062.321069
[5]  
Hu X, 2001, P WORKSH PART SWARM
[6]  
Kaufman L, 1990, FINGING GROUPS DATA
[7]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[8]   In search of optimal clusters using genetic algorithms [J].
Murthy, CA ;
Chowdhury, N .
PATTERN RECOGNITION LETTERS, 1996, 17 (08) :825-832
[9]   A SIMPLEX-METHOD FOR FUNCTION MINIMIZATION [J].
NELDER, JA ;
MEAD, R .
COMPUTER JOURNAL, 1965, 7 (04) :308-313
[10]   NELDER-MEAD SIMPLEX PROCEDURE FOR FUNCTION MINIMIZATION [J].
OLSSON, DM ;
NELSON, LS .
TECHNOMETRICS, 1975, 17 (01) :45-51