%0 Journal Article %1 AlSultan19951443 %A Al-Sultan, Khaled S. %D 1995 %J Pattern Recognition %K 2009 Clustering Nonconvex Simulated Tabu algorithm, annealing clustering k-means optimum problem, programmingGlobal search, seminar %N 9 %P 1443 - 1451 %R DOI: 10.1016/0031-3203(95)00022-R %T A Tabu search approach to the clustering problem %U http://www.sciencedirect.com/science/article/B6V14-3YGTT6V-24/2/dd72fcd939291add2f63315bd3585530 %V 28 %X In this paper we consider the problem of clustering m objects into c clusters. The objects are represented by points in an n-dimensional Euclidean space, and the objective is to classify these m points into c clusters such that the distance between points within a cluster and its center (which is to be found) is minimized. The problem is a nonconvex program that has many local minima. It has been studied by many researchers and the most well-known algorithm for solving it is the k-means algorithm. In this paper, we develop a new algorithm for solving this problem based on a tabu search technique. Preliminary computational experience on the developed algorithm are encouraging and compare favorably with both the k-means and the simulated annealing algorithms.

@article{AlSultan19951443, abstract = {In this paper we consider the problem of clustering m objects into c clusters. The objects are represented by points in an n-dimensional Euclidean space, and the objective is to classify these m points into c clusters such that the distance between points within a cluster and its center (which is to be found) is minimized. The problem is a nonconvex program that has many local minima. It has been studied by many researchers and the most well-known algorithm for solving it is the k-means algorithm. In this paper, we develop a new algorithm for solving this problem based on a tabu search technique. Preliminary computational experience on the developed algorithm are encouraging and compare favorably with both the k-means and the simulated annealing algorithms.}, added-at = {2009-11-12T14:15:54.000+0100}, author = {Al-Sultan, Khaled S.}, biburl = {https://www.bibsonomy.org/bibtex/259b0710da0ece36f68507514201513e8/k.e.}, description = {A Tabu search approach to the clustering problem}, doi = {DOI: 10.1016/0031-3203(95)00022-R}, interhash = {280165e272b368235d501cd4d5f0ecdd}, intrahash = {59b0710da0ece36f68507514201513e8}, issn = {0031-3203}, journal = {Pattern Recognition}, keywords = {2009 Clustering Nonconvex Simulated Tabu algorithm, annealing clustering k-means optimum problem, programmingGlobal search, seminar}, number = 9, pages = {1443 - 1451}, timestamp = {2009-11-12T14:15:54.000+0100}, title = {A Tabu search approach to the clustering problem}, url = {http://www.sciencedirect.com/science/article/B6V14-3YGTT6V-24/2/dd72fcd939291add2f63315bd3585530}, volume = 28, year = 1995 }