A robust dynamic niching genetic algorithm with niche migration for automatic clustering problem

被引:42
作者
Chang, Dong-Xia [1 ,3 ]
Zhang, Xian-Da [1 ]
Zheng, Chang-Wen [2 ]
Zhang, Dao-Ming [1 ]
机构
[1] Tsinghua Univ, Dept Automat, State Key Lab Intelligent Technol & Syst, Tsinghua Natl Lab Informat Silence & Technol, Beijing 100084, Peoples R China
[2] Chinese Acad Sci, Inst Software, Natl Key Lab Integrated Informat Syst Technol, Beijing 100080, Peoples R China
[3] Beijing Jiaotong Univ, Inst Informat Sci, Beijing 100044, Peoples R China
关键词
Clustering; Genetic algorithms; Niching method; Niche migration; Remote sensing image; NUMBER; FUZZY; SIMILARITY; EVOLUTION; VALIDITY;
D O I
10.1016/j.patcog.2009.10.020
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper. a genetic clustering algorithm based on dynamic niching with niche migration (DNNM-clustering) is proposed. It is an effective and robust approach to clustering on the basis of a similarity function relating to the approximate density shape estimation. In the new algorithm, a dynamic identification of the niches with niche migration is performed at each generation to automatically evolve the optimal number of clusters as well as the cluster centers of the data set without invoking cluster validity functions. The niches can move slowly under the migration operator which makes the dynamic niching method independent of the radius of the niches. Compared to other existing methods, the proposed clustering method exhibits the following robust characteristics: (1) robust to the initialization, (2) robust to clusters volumes (ability to detect different volumes of clusters), and (3) robust to noise. Moreover, it is free of the radius of the niches and does not need to pre-specify the number of clusters. Several data sets with widely varying characteristics are used to demonstrate its superiority. An application of the DNNM-clustering algorithm in unsupervised classification of the multispectral remote sensing image is also provided. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1346 / 1360
页数:15
相关论文
共 55 条
[1]  
[Anonymous], 1973, Pattern Classification and Scene Analysis
[2]  
[Anonymous], 1988, Algorithms for Clustering Data
[3]   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
[4]   Genetic clustering for automatic evolution of clusters and application to image classification [J].
Bandyopadhyay, S ;
Maulik, U .
PATTERN RECOGNITION, 2002, 35 (06) :1197-1208
[5]   A point symmetry-based clustering technique for automatic evolution of clusters [J].
Bandyopadhyay, Sanghamitra ;
Saha, Sriparna .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2008, 20 (11) :1441-1457
[6]   GAPS: A clustering method using a new point symmetry-based distance measure [J].
Bandyopadhyay, Sanghamitra ;
Saha, Sriparna .
PATTERN RECOGNITION, 2007, 40 (12) :3430-3451
[7]   A Sequential Niche Technique for Multimodal Function Optimization [J].
Beasley, David ;
Bull, David R. ;
Martin, Ralph R. .
EVOLUTIONARY COMPUTATION, 1993, 1 (02) :101-125
[8]  
Bezdek J. C., 1981, Pattern recognition with fuzzy objective function algorithms
[9]   A genetic algorithm with gene rearrangement for K-means clustering [J].
Chang, Dong-Xia ;
Zhang, Xian-Da ;
Zheng, Chang-Wen .
PATTERN RECOGNITION, 2009, 42 (07) :1210-1222
[10]  
Darwen P., 1996, PARALLEL PROBLEM SOL, V1141, P398