arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.02701cs.DB
收藏

基于概率数据结构的流聚类

Stream Clustering using Probabilistic Data Structures

Andrei Sorin Sabau

摘要:

大多数基于密度的流聚类算法将聚类过程分为在线和离线组件。精确的汇总统计数据被用于定义微集群或网格单元在在线阶段,然后在离线阶段的宏观集群。本文提出了一种新的替代传统的两阶段流聚类方案,引入基于草图的数据结构评估流密度和集群成员的概率精度保证。使用阻尼窗口模型的最小计数草图估计流密度。布隆过滤器采用主动-主动缓冲的变化来估计集群成员资格。这两种类型的草图的散列共享同一组散列函数。由此产生的流聚类算法是能够检测任意形状的集群,同时正确地处理离群值,并不假设集群的总数。在真实数据集和人工数据集上的实验结果表明了该算法的质量和效率。

英文摘要:

Most density based stream clustering algorithms separate the clustering process into an online and offline component. Exact summarized statistics are being employed for defining micro-clusters or grid cells during the online stage followed by macro-clustering during the offline stage. This paper proposes a novel alternative to the traditional two phase stream clustering scheme, introducing sketch-based data structures for assessing both stream density and cluster membership with probabilistic accuracy guarantees. A count-min sketch using a damped window model estimates stream density. Bloom filters employing a variation of active-active buffering estimate cluster membership. Instances of both types of sketches share the same set of hash functions. The resulting stream clustering algorithm is capable of detecting arbitrarily shaped clusters while correctly handling outliers and making no assumption on the total number of clusters. Experimental results over a number of real and synthetic datasets illustrate the proposed algorithm quality and efficiency.

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

↑