arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.04600cs.LGcs.IR
收藏

快速K-Means聚类估计

Faster K-Means Cluster Estimation

Indian Institute of Technology Guwahati(印度理工学院古瓦哈提分校)

Siddhesh Khandelwal, Amit Awekar

摘要:

在改进流行的聚类算法“K-means”方面,在均方误差(MSE)和速度方面都做了大量的工作。然而,大多数k-means变体倾向于计算每个数据点到每个聚类质心的距离。我们提出了一个快速的启发式,以克服这个瓶颈,只有边际增加MSE。我们观察到,在K-means的所有迭代中,数据点仅在一小部分聚类中改变其成员资格。我们的启发式算法通过在第一次k-means迭代后查看附近的聚类来预测每个数据点的聚类。我们增加众所周知的变种k-means与我们的启发式,以证明我们的启发式的有效性。对于各种合成和真实世界的数据集,与k-means的有效变体相比,我们的启发式算法实现了高达3倍的速度提升。

英文摘要:

There has been considerable work on improving popular clustering algorithm `K-means' in terms of mean squared error (MSE) and speed, both. However, most of the k-means variants tend to compute distance of each data point to each cluster centroid for every iteration. We propose a fast heuristic to overcome this bottleneck with only marginal increase in MSE. We observe that across all iterations of K-means, a data point changes its membership only among a small subset of clusters. Our heuristic predicts such clusters for each data point by looking at nearby clusters after the first iteration of k-means. We augment well known variants of k-means with our heuristic to demonstrate effectiveness of our heuristic. For various synthetic and real-world datasets, our heuristic achieves speed-up of up-to 3 times when compared to efficient variants of k-means.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑