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

面向时序数据的随时间演化鲁棒聚类

Evolutionary Robust Clustering Over Time for Temporal Data

Qi Zhao, Bai Yan, Yuhui Shi

AI总结:

针对现有动态聚类将时间平滑性作为先验偏好易导致意外收敛的问题,提出随时间演化鲁棒聚类框架,以后验方式处理平滑性并自动调权,无需亲和矩阵与预定义参数。

摘要:

在许多聚类场景中,数据样本的属性值会随时间变化。对于此类数据,我们通常希望获得每个时间步的一个划分,并跟踪各划分的动态变化。通常,为使数据具有时间平滑性,会假设其变化是平滑的。现有算法将时间平滑性视为一种先验偏好,并使搜索偏向该偏好方向。这种先验方式存在收敛到意外区域的风险,因为在对数据先验知识了解甚少的情况下,并不总是能够引出合理的偏好。为解决这一问题,本文提出了一种名为随时间演化鲁棒聚类的新聚类框架。该框架的一项重要创新是以事后方式处理时间平滑性,从而避免现有算法中出现的意外收敛问题。此外,该框架无需数据的亲和矩阵和预定义参数即可自动调整平滑性权重,具有更好的适用性和可扩展性。通过在合成数据集和真实数据集上与最先进算法进行比较,验证了所提框架的有效性和效率。

英文摘要:

In many clustering scenes, data samples' attribute values change over time. For such data, we are often interested in obtaining a partition for each time step and tracking the dynamic change of partitions. Normally, a smooth change is assumed for data to have a temporal smooth nature. Existing algorithms consider the temporal smoothness as an a priori preference and bias the search towards the preferred direction. This a priori manner leads to a risk of converging to an unexpected region because it is not always the case that a reasonable preference can be elicited given the little prior knowledge about the data. To address this issue, this paper proposes a new clustering framework called evolutionary robust clustering over time. One significant innovation of the proposed framework is processing the temporal smoothness in an a posteriori manner, which avoids unexpected convergence that occurs in existing algorithms. Furthermore, the proposed framework automatically tunes the weight of smoothness without data's affinity matrix and predefined parameters, which holds better applicability and scalability. The effectiveness and efficiency of the proposed framework are confirmed by comparing with state-of-the-art algorithms on both synthetic and real datasets.

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

↑