Deep time-series clustering via latent representation alignment

IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Knowledge-Based Systems Pub Date : 2024-11-04 Epub Date: 2024-08-29 DOI:10.1016/j.knosys.2024.112434
Sangho Lee, Chihyeon Choi, Youngdoo Son
{"title":"Deep time-series clustering via latent representation alignment","authors":"Sangho Lee,&nbsp;Chihyeon Choi,&nbsp;Youngdoo Son","doi":"10.1016/j.knosys.2024.112434","DOIUrl":null,"url":null,"abstract":"<div><p>In practice, obtaining sufficient label information from a dataset is challenging. Consequently, various clustering methods have been studied to homogeneously group data without label information. Recently, deep clustering approaches that utilize deep neural networks have garnered considerable attention. However, time series data possess unique characteristics, including temporal relationships between observations in a sequence, which can decrease the performance of existing deep clustering methods when applied to time series. Despite this, few studies on deep clustering have addressed the characteristics of time series. Thus, we propose a novel approach for deep time-series clustering using <em>topological information</em>, enabling the capture of underlying temporal patterns to generate cluster-oriented representations. We address the topological information of a time series by introducing a novel loss function based on the eigendecomposition of representations in latent space. Through experiments on various time-series datasets, we demonstrate the efficacy of the proposed method in achieving superior clustering performance compared to state-of-the-art deep clustering methods. To the best of our knowledge, this is the first approach that utilizes topological information for deep time-series clustering.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"303 ","pages":"Article 112434"},"PeriodicalIF":7.6000,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705124010682","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/8/29 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In practice, obtaining sufficient label information from a dataset is challenging. Consequently, various clustering methods have been studied to homogeneously group data without label information. Recently, deep clustering approaches that utilize deep neural networks have garnered considerable attention. However, time series data possess unique characteristics, including temporal relationships between observations in a sequence, which can decrease the performance of existing deep clustering methods when applied to time series. Despite this, few studies on deep clustering have addressed the characteristics of time series. Thus, we propose a novel approach for deep time-series clustering using topological information, enabling the capture of underlying temporal patterns to generate cluster-oriented representations. We address the topological information of a time series by introducing a novel loss function based on the eigendecomposition of representations in latent space. Through experiments on various time-series datasets, we demonstrate the efficacy of the proposed method in achieving superior clustering performance compared to state-of-the-art deep clustering methods. To the best of our knowledge, this is the first approach that utilizes topological information for deep time-series clustering.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过潜在表征对齐进行深度时间序列聚类
实际上,从数据集中获取足够的标签信息具有挑战性。因此,人们研究了各种聚类方法,以便在没有标签信息的情况下对数据进行同质分组。最近,利用深度神经网络的深度聚类方法受到了广泛关注。然而,时间序列数据具有独特的特征,包括序列中观测值之间的时间关系,这可能会降低现有深度聚类方法应用于时间序列时的性能。尽管如此,有关深度聚类的研究很少涉及时间序列的特性。因此,我们提出了一种利用拓扑信息进行深度时间序列聚类的新方法,从而捕捉潜在的时间模式,生成面向聚类的表示。针对时间序列的拓扑信息,我们引入了一种基于潜空间表征特征分解的新型损失函数。通过在各种时间序列数据集上的实验,我们证明了与最先进的深度聚类方法相比,所提出的方法在实现卓越聚类性能方面的功效。据我们所知,这是第一种利用拓扑信息进行深度时间序列聚类的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
期刊最新文献
Revisiting the role of linguistic knowledge in large language models through prompting ACO–PAL: A prior-Aware learning framework for local path planning in complex environments LLM-enabled universal traffic signal control across different intersections and traffic flows Multi-view semi-supervised classification via innovative graph construction and smoothness-aware graph convolution Galio: Defending ownership of AI-generated images against content-preserving tampering
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1