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

高效动态聚类:从历史聚类演化中捕捉模式

Efficient Dynamic Clustering: Capturing Patterns from Historical Cluster Evolution

Binbin Gu, Saeed Kargar, Faisal Nawab

AI总结:

针对高速动态场景中对象持续变化导致批处理聚类开销高的问题,提出利用历史结果的DynamicC系统,结合机器学习模型与批处理算法,实验表明其性能优于现有方法且准确性与基线相近。

摘要:

聚类旨在基于对象间固有的相似性将未标记对象分组为簇,对异常检测、数据库分片、记录链接等诸多任务至关重要。部分聚类方法为批处理算法,需从零开始对数据库中所有对象聚类或假设增量工作负载,因此开销高昂。实际中,数据库对象持续更新、新增和删除,导致先前结果过时。在此类场景中持续运行批处理算法不可行,因其会产生显著开销,尤其是在物联网应用等高速度场景中。本文解决了高速动态场景中的聚类问题,其中对象持续更新、插入和删除。具体而言,我们提出一种利用先前聚类结果的通用动态聚类方法。我们的系统DynamicC采用机器学习模型,该模型由现有批处理算法增强。DynamicC模型通过观察批处理算法做出的聚类决策进行训练。训练后,DynamicC模型与批处理算法协同使用,以实现准确且快速的聚类决策。在四个真实世界数据集和一个合成数据集上的实验结果表明,与最先进方法相比,我们的方法性能更优,同时聚类结果准确性与基线批处理算法相近。

英文摘要:

Clustering aims to group unlabeled objects based on similarity inherent among them into clusters. It is important for many tasks such as anomaly detection, database sharding, record linkage, and others. Some clustering methods are taken as batch algorithms that incur a high overhead as they cluster all the objects in the database from scratch or assume an incremental workload. In practice, database objects are updated, added, and removed from databases continuously which makes previous results stale. Running batch algorithms is infeasible in such scenarios as it would incur a significant overhead if performed continuously. This is particularly the case for high-velocity scenarios such as ones in Internet of Things applications. In this paper, we tackle the problem of clustering in high-velocity dynamic scenarios, where the objects are continuously updated, inserted, and deleted. Specifically, we propose a generally dynamic approach to clustering that utilizes previous clustering results. Our system, DynamicC, uses a machine learning model that is augmented with an existing batch algorithm. The DynamicC model trains by observing the clustering decisions made by the batch algorithm. After training, the DynamicC model is usedin cooperation with the batch algorithm to achieve both accurate and fast clustering decisions. The experimental results on four real-world and one synthetic datasets show that our approach has a better performance compared to the state-of-the-art method while achieving similarly accurate clustering results to the baseline batch algorithm.

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

↑