通过动态掩码提升时序聚类效果,让模型更关注关键时间点。
Mask the Redundancy: Evolving Masking Representation Learning for Multivariate Time-Series Clustering
- 设计自适应变量子掩码机制,动态聚焦重要时间点。
- 在15个数据集上平均提升4.85%的F1分数,超越当前最优方法。
- 适合处理含冗余信息的多变量时序数据聚类任务。
多变量时间序列(MTS)聚类旨在发现时序样本中的内在分组模式。尽管时间序列蕴含丰富判别信息,但也存在大量冗余,如设备稳定运行记录和太阳能发电的零输出时段。这些冗余会削弱对判别性时间点的关注,从而制约MTS聚类的表示学习性能。掩码技术已被广泛用于增强MTS表示,通过时间重建任务捕捉关键信息。然而,现有掩码策略多为独立预处理步骤,与学习过程脱节,难以动态适应聚类关键时间点的重要性。为此,本文提出进化掩码时间序列聚类(EMTC)方法,其模型包含感知重要性的变量子掩码(IVM)和多内生视图(MEV)生成模块。IVM引导模型学习更具判别性的表示,而重建与聚类引导的对比学习路径增强了表示学习并将其与聚类任务关联。在15个基准数据集上的实验表明,EMTC显著优于8种SOTA方法,平均F1分数提升4.85%。
原文摘要 · Abstract (English)
Multivariate Time-Series (MTS) clustering discovers intrinsic grouping patterns of temporal data samples. Although time-series provide rich discriminative information, they also contain substantial redundancy, such as steady-state machine operation records and zero-output periods of solar power generation. Such redundancy diminishes the attention given to discriminative timestamps in representation learning, thus leading to performance bottlenecks in MTS clustering. Masking has been widely adopted to enhance the MTS representation, where temporal reconstruction tasks are designed to capture critical information from MTS. However, most existing masking strategies appear to be standalone preprocessing steps, isolated from the learning process, which hinders dynamic adaptation to the importance of clustering-critical timestamps. Accordingly, this paper proposes the Evolving-masked MTS Clustering (EMTC) method, whose model architecture comprises Importance-aware Variate-wise Masking (IVM) and Multi-Endogenous Views (MEV) generation modules. IVM adaptively guides the model in learning more discriminative representations for clustering, while the reconstruction and cluster-guided contrastive learning pathways enhance and connect the representation learning to clustering tasks. Extensive experiments on 15 benchmark datasets demonstrate the superiority of EMTC over eight SOTA methods, where the EMTC achieves an average improvement of 4.85% in F1-Score over the strongest baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。