A tabu search based method for minimum sum of squares clustering

Authors:
Yongguo Liu;Libin Wang;Kefei Chen
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, P. R. China;Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, P. R. China;Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, P. R. China
Venue:
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
Year:
2005

Citing 7
Cited 0

Algorithms for clustering data

Algorithms for clustering data
Multidimensional data clustering utilizing hybrid search strategies

Pattern Recognition
A new clustering algorithm with multiple runs of iterative procedures

Pattern Recognition
In search of optimal clusters using genetic algorithms

Pattern Recognition Letters
Interactive Pattern Recognition

Interactive Pattern Recognition
Tabu Search

Tabu Search
A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization

Proceedings of the 3rd International Conference on Genetic Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, the metaheuristic algorithm, tabu search, is proposed to deal with the clustering problem under the criterion of minimum sum of squares clustering. The presented method integrates four moving operations and mutation operation into tabu search. Its superiority over local search clustering algorithms and another tabu clustering approach is extensively demonstrated for artificial and real life data sets.