基于对比学习和动态多样性的时间序列深度聚类集成算法
CSTR:
作者:
作者单位:

1.盐城工学院;2.哈尔滨工程大学 信息与通信工程学院

作者简介:

通讯作者:

中图分类号:

TP181; TP301

基金项目:

国家自然科学基金项目(62076215, 62301473),江苏高校“青蓝工程”,盐城市产业创新科技支撑(工业)专项(YCBG2025201)


Time series deep clustering ensemble algorithm based on contrastive learning and dynamic diversity
Author:
Affiliation:

Fund Project:

National Natural Science Foundation of China (No. 62076215, No. 62301473), Jiangsu University Qing Lan Project and Yancheng Industrial Innovation Technology Support (Industrial) Special Program(NO. YCBG2025201)

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    时间序列深度聚类方法能有效从无标记时序数据中自动学习判别性特征与聚类结构.为进一步提升模型的鲁棒性与泛化能力,聚类集成技术被引入.然而,现有深度聚类集成方法通常需独立训练多个模型以生成多样性基聚类,导致计算成本高昂、资源消耗大,且难以在单一模型中协同优化质量与多样性.针对上述问题,本文提出一种基于对比学习和动态多样性的时间序列深度聚类集成算法.首先,设计时序编码器提取多层次时序特征,并通过时间级和实例级对比学习增强特征判别性;其次,构建多投影头聚类生成机制,基于互信息实现动态多样性约束,从而协同优化基聚类的质量与差异度;最后,将聚类目标与多样性约束融入到端到端训练框架,实现对时序数据的鲁棒且精准划分.在10个公开UCR数据集上的实验结果表明,所提算法在聚类效果上显著优于现有基线方法,并在保持较高性能的同时有效降低了计算开销.

    Abstract:

    Time series deep clustering methods can effectively learn discriminative features and clustering structures automatically from unlabeled temporal data. To further enhance the model"s robustness and generalization capability, clustering ensemble techniques have been introduced. However, existing deep clustering ensemble methods often require training multiple models independently to generate diverse base clusterings, resulting in high computational costs, significant resource consumption, and difficulty in collaboratively optimizing quality and diversity within a single model. To address these issues, this paper proposes a time series deep clustering ensemble algorithm based on contrastive learning and dynamic diversity. First, a temporal encoder is designed to extract multi-level temporal features, and the discriminative power of the features is enhanced through temporal-level and instance-level contrastive learning. Second, a multi-projection-head clustering generation mechanism is constructed, which enforces dynamic diversity constraints based on mutual information, thereby collaboratively optimizing the quality and diversity of base clusterings. Finally, both clustering objectives and diversity constraints are integrated into an end-to-end training framework to achieve robust and accurate partitioning of temporal data. Experimental results on ten public UCR datasets demonstrate that the proposed algorithm significantly outperforms existing baseline methods in clustering performance, while effectively reducing computational costs while maintaining high performance.

    参考文献
    相似文献
    引证文献
引用本文
相关视频

分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2026-03-29
  • 最后修改日期:2026-07-13
  • 录用日期:2026-07-14
  • 在线发布日期: 2026-08-12
  • 出版日期:
文章二维码