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

作者:

Highlights:

摘要

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.

论文关键词:Clustering,Genetic algorithms,Niching method,Niche migration,Remote sensing image

论文评审过程:Received 16 January 2009, Revised 1 October 2009, Accepted 4 October 2009, Available online 17 November 2009.

论文官网地址:https://doi.org/10.1016/j.patcog.2009.10.020