Evolutionary multi-objective clustering with adaptive local search

In many real-world applications, the accurate number of clusters in the data set may be unknown in advance. In addition, clustering criteria are usually high dimensional, nonlinear and multi-model functions and most existing clustering algorithms are only able to achieve a clustering solution that locally optimizes them. Therefore, a single clustering criterion sometimes fails to identify all clusters in a data set successfully. This paper presents a novel multi-objective evolutionary clustering algorithm based on adaptive local search that mitigates the above disadvantages of existing clustering algorithms. Unlike the conventional local search, the proposed adaptive local search scheme automatically determines whether local search is used in an evolutionary cycle or not. Experimental results on several artificial and real data sets demonstrate that the proposed algorithm can identify the accurate number of clusters in the data sets automatically and simultaneously achieves a high quality clustering solution. The superiority of the proposed algorithm over some single-objective clustering algorithms and existing multi-objective evolutionary clustering algorithms is also confirmed by the experimental results.

[1]  Sam Kwong,et al.  Multi-Objective Evolutionary Clustering using Variable-Length Real Jumping Genes Genetic Algorithm , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[2]  Joydeep Ghosh,et al.  Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..

[3]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[4]  Ujjwal Maulik,et al.  Genetic algorithm-based clustering technique , 2000, Pattern Recognit..

[5]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[6]  Kim-Fung Man,et al.  A real-coding jumping gene genetic algorithm (RJGGA) for multiobjective optimization , 2007, Inf. Sci..

[7]  Bernd Freisleben,et al.  Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming , 2002, J. Heuristics.

[8]  Joshua D. Knowles,et al.  Exploiting the Trade-off - The Benefits of Multiple Objectives in Data Clustering , 2005, EMO.

[9]  Hisao Ishibuchi,et al.  IMPLEMENTATION OF LOCAL SEARCH IN HYBRID MULTI-OBJECTIVE GENETIC ALGORITHMS : A CASE STUDY ON FLOWSHOP SCHEDULING , 2022 .

[10]  Joshua D. Knowles,et al.  Evolutionary Multiobjective Clustering , 2004, PPSN.

[11]  Joydeep Ghosh,et al.  CLUMP: a scalable and robust framework for structure discovery , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[12]  Anil K. Jain,et al.  Clustering ensembles: models of consensus and weak partitions , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  James C. Bezdek,et al.  Clustering with a genetically optimized approach , 1999, IEEE Trans. Evol. Comput..

[14]  Robert Tibshirani,et al.  Estimating the number of clusters in a data set via the gap statistic , 2000 .

[15]  Jun Zhu,et al.  Genetic Algorithms Applied to Multi-Class Clustering for Gene Expression Data , 2003, Genomics, proteomics & bioinformatics.

[16]  A. Kai Qin,et al.  Enhanced neural gas network for prototype-based clustering , 2005, Pattern Recognit..

[17]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[18]  YoungSu Yun,et al.  Hybrid genetic algorithm with adaptive local search scheme , 2006, Comput. Ind. Eng..