论文标题
深度的临时对比聚类
Deep Temporal Contrastive Clustering
论文作者
论文摘要
最近,深度学习显示了其在表示时间序列数据的表示和聚类中的优势。尽管取得了很大的进步,但现有的深度时间序列聚类方法主要试图通过某些实例基于重建或基于群集的分布目标来训练深神网络,但是,这些目标缺乏利用样本(或增强)对比信息的能力,甚至是对较高级别的(例如,群集 - 群集 - 群集)的对比,以对比度的对比和构造构成了异形。鉴于此,本文提出了一种深度的时间对比聚类(DTCC)方法,据我们所知,该方法首次将对比度学习范式纳入了深度时间序列序列集群研究中。具体而言,通过从原始时间序列及其增强产生的两个并行视图,我们利用两个相同的自动编码器来学习相应的表示形式,同时通过合并K均值目标来执行群集分布学习。此外,同时执行了两个级别的对比学习,以分别捕获实例级别和群集级对比度信息。随着自动编码器的重建损失,集群分布损失以及共同优化的对比度损失的两个级别,网络体系结构以自我监督的方式进行训练,因此可以获得聚类结果。各种时间序列数据集的实验证明了我们的DTCC方法优于最先进的方法。
Recently the deep learning has shown its advantage in representation learning and clustering for time series data. Despite the considerable progress, the existing deep time series clustering approaches mostly seek to train the deep neural network by some instance reconstruction based or cluster distribution based objective, which, however, lack the ability to exploit the sample-wise (or augmentation-wise) contrastive information or even the higher-level (e.g., cluster-level) contrastiveness for learning discriminative and clustering-friendly representations. In light of this, this paper presents a deep temporal contrastive clustering (DTCC) approach, which for the first time, to our knowledge, incorporates the contrastive learning paradigm into the deep time series clustering research. Specifically, with two parallel views generated from the original time series and their augmentations, we utilize two identical auto-encoders to learn the corresponding representations, and in the meantime perform the cluster distribution learning by incorporating a k-means objective. Further, two levels of contrastive learning are simultaneously enforced to capture the instance-level and cluster-level contrastive information, respectively. With the reconstruction loss of the auto-encoder, the cluster distribution loss, and the two levels of contrastive losses jointly optimized, the network architecture is trained in a self-supervised manner and the clustering result can thereby be obtained. Experiments on a variety of time series datasets demonstrate the superiority of our DTCC approach over the state-of-the-art.