arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.6199cs.DScs.AI
收藏

在数据流中实现近似软聚类

Achieving Approximate Soft Clustering in Data Streams

AT&T Labs - Research(AT&T实验室 - 研究)

Vaneet Aggarwal, Shankar Krishnan

摘要:

近年来,数据流由于技术的进步而变得突出,这些技术使许多应用程序能够生成连续的数据流。这增加了开发能够有效处理数据流的算法的需求。此外,数据流的实时性要求和不断变化的性质使得流挖掘问题,包括聚类,具有挑战性的研究问题。在本文中,我们提出了一个单通道流软聚类(一个点在集群中的成员是由分布描述)算法,它近似于“软”版本的k-均值目标函数。软聚类在数据库和机器学习的各个方面都有应用,包括密度估计和学习混合模型。我们首先实现一个简单的伪近似的“硬”k均值算法,该算法允许输出多个$k$中心。我们将此批处理算法转换为流处理算法(使用最近提出的k-means++算法的扩展)的“收银机”模型。我们还扩展了该算法的聚类时,在数据流中的移动窗口。

英文摘要:

In recent years, data streaming has gained prominence due to advances in technologies that enable many applications to generate continuous flows of data. This increases the need to develop algorithms that are able to efficiently process data streams. Additionally, real-time requirements and evolving nature of data streams make stream mining problems, including clustering, challenging research problems. In this paper, we propose a one-pass streaming soft clustering (membership of a point in a cluster is described by a distribution) algorithm which approximates the "soft" version of the k-means objective function. Soft clustering has applications in various aspects of databases and machine learning including density estimation and learning mixture models. We first achieve a simple pseudo-approximation in terms of the "hard" k-means algorithm, where the algorithm is allowed to output more than $k$ centers. We convert this batch algorithm to a streaming one (using an extension of the k-means++ algorithm recently proposed) in the "cash register" model. We also extend this algorithm when the clustering is done over a moving window in the data stream.

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

↑