A tabu-search-based heuristic for clustering
A tabu-search-based heuristic for clustering
复制标题
DOI：
10.1016/s0031-3203(99)00090-4
复制
发表时间：
2000-05-01
影响因子：
8
通讯作者：
Jin, HW
中科院分区：
文献类型：
--
作者：
Sung, CS;Jin, HW
This paper considers a clustering problem where a given data set is partitioned into a certain number of natural and homogeneous subsets such that each subset is composed of elements similar to one another but different from those of any other subset. For the clustering problem, a heuristic algorithm is exploited by combining the tabu search heuristic with two complementary functional procedures, called packing and releasing procedures. The algorithm is numerically tested for its effectiveness in comparison with reference works including the tabu search algorithm, the K-means algorithm and the simulated annealing algorithm. (C) 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
