Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach

The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the optimization property of tabu search and the local search capability of k-means algorithm together. The contribution of proposed algorithm is to produce tabu space for escaping from the trap of local optima and finding better solutions effectively. The Tabu-KM algorithm is tested on several simulated and standard datasets and its performance is compared with k-means, simulated annealing, tabu search, genetic algorithm, and ant colony optimization algorithms. The experimental results on simulated and standard test problems denote the robustness and efficiency of the algorithm and confirm that the proposed method is a suitable choice for solving data clustering problems.

[1]  Kuo-Sheng Cheng,et al.  Evolution-Based Tabu Search Approach to Automatic Clustering , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[2]  SANGHAMITRA BANDYOPADHYAY,et al.  Clustering Using Simulated Annealing with Probabilistic Redistribution , 2001, Int. J. Pattern Recognit. Artif. Intell..

[3]  Michel Gendreau,et al.  An Introduction to Tabu Search , 2003, Handbook of Metaheuristics.

[4]  Mao Ye,et al.  A tabu search approach for the minimum sum-of-squares clustering problem , 2008, Inf. Sci..

[5]  Zülal Güngör,et al.  K-Harmonic means data clustering with tabu-search method , 2008 .

[6]  Olli Nevalainen,et al.  Self-Adaptive Genetic Algorithm for Clustering , 2003, J. Heuristics.

[7]  Khaled S. Al-Sultan,et al.  A Tabu search approach to the clustering problem , 1995, Pattern Recognit..

[8]  Alfonsas Misevičius,et al.  AN OVERVIEW OF SOME HEURISTIC ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS , 2004 .

[9]  Kefei Chen,et al.  A Tabu Search Based Method for Minimum Sum of Squares Clustering , 2005, ICAPR.

[10]  Michael J. Brusco,et al.  Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques , 2007, J. Classif..

[11]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[12]  B. Kulkarni,et al.  An ant colony approach for clustering , 2004 .

[13]  Khaled S. Al-Sultan,et al.  Computational experience on four algorithms for the hard clustering problem , 1996, Pattern Recognit. Lett..

[14]  Shokri Z. Selim,et al.  K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Anthony K. H. Tung,et al.  On the Lower Bound of Local Optimums in K-Means Algorithm , 2006, Sixth International Conference on Data Mining (ICDM'06).

[16]  M. Narasimha Murty,et al.  Genetic K-means algorithm , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[17]  Z SelimShokri,et al.  K-Means-Type Algorithms , 1984 .

[18]  Yan Liu,et al.  A Hybrid Tabu Search Based Clustering Algorithm , 2005, KES.

[19]  Lawrence Hubert,et al.  Order-Constrained Solutions in K-Means Clustering: Even Better Than Being Globally Optimal , 2008 .

[20]  Ujjwal Maulik,et al.  An evolutionary technique based on K-Means algorithm for optimal clustering in RN , 2002, Inf. Sci..

[21]  Khaled S. Al-Sultan,et al.  A tabu search-based algorithm for the fuzzy clustering problem , 1997, Pattern Recognit..

[22]  Chang Sup Sung,et al.  A tabu-search-based heuristic for clustering , 2000, Pattern Recognit..