arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.07516cs.LGcs.DS
收藏

模糊$K$ -均值问题的核集构造

On Coreset Constructions for the Fuzzy $K$-Means Problem

Paderborn University(帕德博恩大学)

Johannes Blömer, Sascha Brauer, Kathrin Bujna

摘要:

模糊$K$ -均值问题是将著名的$K$ -均值问题推广到软聚类的一种流行的方法。我们提出了第一个coresets的模糊$K$ -意味着尺寸线性的尺寸,多项式的聚类数,和多对数的点数。我们表明,这些coresets可以采用在计算的$(1+ε)$ -近似模糊$K$ -手段,改善以前提出的结果。我们进一步表明,我们的coresets可以保持在一个只插入流设置,数据点到达一个接一个。

英文摘要:

The fuzzy $K$-means problem is a popular generalization of the well-known $K$-means problem to soft clusterings. We present the first coresets for fuzzy $K$-means with size linear in the dimension, polynomial in the number of clusters, and poly-logarithmic in the number of points. We show that these coresets can be employed in the computation of a $(1+ε)$-approximation for fuzzy $K$-means, improving previously presented results. We further show that our coresets can be maintained in an insertion-only streaming setting, where data points arrive one-by-one.

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

↑