MS-SRALAT: Multi-granularity SubStructure-aware Representation Learning Algorithm for Time-series

Thapana Boonchoo
{"title":"MS-SRALAT: Multi-granularity SubStructure-aware Representation Learning Algorithm for Time-series","authors":"Thapana Boonchoo","doi":"10.1109/jcsse54890.2022.9836269","DOIUrl":null,"url":null,"abstract":"Time-series representation is essential in many data mining algorithms, such as clustering, classification, motif discovery, which have been used to discover knowledge from the time-series data. In this paper, we propose an algorithm to learn the semantic representation of a symbol sequence which is generated corresponding to a time-series by an approximation algorithm that can capture the structure of original data. However, the granularity of structure (coarse-to fine-grained) approximated by such an algorithm is defined by a parameter which affects the quality of resulting representation, and therefore impacts the performance of its subsequent tasks. We then propose a multi-granularity substructure-aware representation learning algorithm for time-series (MS-SRALAT) which is an ensemble model that incorporates the trained models with different granularity to produce more robust representations. The resulted experiments on the benchmark datasets showed the superiority of MS-SRALAT over single-granularity learning models, and comparable performances compared to the exact baseline methods while suggesting good scalability for the similar search task.","PeriodicalId":284735,"journal":{"name":"2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 19th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/jcsse54890.2022.9836269","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Time-series representation is essential in many data mining algorithms, such as clustering, classification, motif discovery, which have been used to discover knowledge from the time-series data. In this paper, we propose an algorithm to learn the semantic representation of a symbol sequence which is generated corresponding to a time-series by an approximation algorithm that can capture the structure of original data. However, the granularity of structure (coarse-to fine-grained) approximated by such an algorithm is defined by a parameter which affects the quality of resulting representation, and therefore impacts the performance of its subsequent tasks. We then propose a multi-granularity substructure-aware representation learning algorithm for time-series (MS-SRALAT) which is an ensemble model that incorporates the trained models with different granularity to produce more robust representations. The resulted experiments on the benchmark datasets showed the superiority of MS-SRALAT over single-granularity learning models, and comparable performances compared to the exact baseline methods while suggesting good scalability for the similar search task.
MS-SRALAT:时间序列的多粒度子结构感知表示学习算法
时间序列表示在聚类、分类、基序发现等数据挖掘算法中起着至关重要的作用,已被用于从时间序列数据中发现知识。在本文中,我们提出了一种算法来学习与时间序列相对应的符号序列的语义表示,该算法采用一种可以捕获原始数据结构的近似算法。然而,这种算法近似的结构粒度(粗粒度到细粒度)是由一个参数定义的,该参数影响结果表示的质量,从而影响其后续任务的性能。然后,我们提出了一种多粒度子结构感知的时间序列表示学习算法(MS-SRALAT),该算法是一种集成模型,它将不同粒度的训练模型合并在一起,以产生更鲁棒的表示。在基准数据集上的实验结果表明,MS-SRALAT优于单粒度学习模型,并且与精确基线方法相比具有相当的性能,同时表明对于类似的搜索任务具有良好的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信