基于量化均值禁忌搜索的K均值聚类
K-Means Clustering using Tabu Search with Quantized Means
摘要:
禁忌搜索(TS)元启发式已被提出的K-Means聚类作为一种替代劳埃德的算法,它的所有易于实现和快速运行时,有被困在局部最优的主要缺点。虽然TS方法可以产生优越的性能,但它涉及高计算复杂性。此外,在现有的TS方法中的参数选择的困难并没有使它更有吸引力。本文提出了一种替代的,低复杂度的制定TS优化过程的K均值聚类。这种方法不需要很多参数设置。我们最初将中心约束为数据集中的点。然后,我们的目标是使用一个独特的邻域结构,利用目标函数的梯度信息来发展这些中心。这导致了对搜索空间的有效探索,之后,对平均值进行细化。该方案在MATLAB中实现,并在四个真实世界的数据集上进行了测试,它实现了显着的改进,在现有的TS方法的簇内平方和和计算时间。
英文摘要:
The Tabu Search (TS) metaheuristic has been proposed for K-Means clustering as an alternative to Lloyd's algorithm, which for all its ease of implementation and fast runtime, has the major drawback of being trapped at local optima. While the TS approach can yield superior performance, it involves a high computational complexity. Moreover, the difficulty in parameter selection in the existing TS approach does not make it any more attractive. This paper presents an alternative, low-complexity formulation of the TS optimization procedure for K-Means clustering. This approach does not require many parameter settings. We initially constrain the centers to points in the dataset. We then aim at evolving these centers using a unique neighborhood structure that makes use of gradient information of the objective function. This results in an efficient exploration of the search space, after which the means are refined. The proposed scheme is implemented in MATLAB and tested on four real-world datasets, and it achieves a significant improvement over the existing TS approach in terms of the intra cluster sum of squares and computational time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。