Shapelet selection for time series classification

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Cun Ji, Yanxuan Wei, Xiangwei Zheng
{"title":"Shapelet selection for time series classification","authors":"Cun Ji,&nbsp;Yanxuan Wei,&nbsp;Xiangwei Zheng","doi":"10.1016/j.asoc.2024.112431","DOIUrl":null,"url":null,"abstract":"<div><div>In recent times, increasing attention has been given to shapelet-based methods for time series classification. However, in the majority of current methods, similar subsequences were often selected as shapelets, thereby reducing the final interpretability of these methods. Aiming to circumvent the selection of similar subsequences as the final shapelets, a novel shapelet selection method (SSM) was proposed in this paper. Firstly, shapelet candidates were generated by SSM through time series segmentation to avoid excessive generation of similar candidates from a single time series. Secondly, all shapelet candidates were evaluated simultaneously to improve evaluation efficiency. Finally, SSM introduced a position-based filter to prevent the selection of similar sequences repeatedly. The results obtained on the UCR TSC archive demonstrated the effectiveness of the proposed method.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"167 ","pages":"Article 112431"},"PeriodicalIF":7.2000,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494624012055","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In recent times, increasing attention has been given to shapelet-based methods for time series classification. However, in the majority of current methods, similar subsequences were often selected as shapelets, thereby reducing the final interpretability of these methods. Aiming to circumvent the selection of similar subsequences as the final shapelets, a novel shapelet selection method (SSM) was proposed in this paper. Firstly, shapelet candidates were generated by SSM through time series segmentation to avoid excessive generation of similar candidates from a single time series. Secondly, all shapelet candidates were evaluated simultaneously to improve evaluation efficiency. Finally, SSM introduced a position-based filter to prevent the selection of similar sequences repeatedly. The results obtained on the UCR TSC archive demonstrated the effectiveness of the proposed method.
用于时间序列分类的小形选择
近来,基于小形的时间序列分类方法受到越来越多的关注。然而,在目前的大多数方法中,相似子序列往往被选为小形,从而降低了这些方法的最终可解释性。为了避免选择相似子序列作为最终的小形,本文提出了一种新的小形选择方法(SSM)。首先,SSM 通过时间序列分割生成形状子候选序列,以避免从单一时间序列中生成过多的相似候选序列。其次,同时评估所有小形候选,以提高评估效率。最后,SSM 引入了基于位置的过滤器,以防止重复选择相似序列。在 UCR TSC 档案中获得的结果证明了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
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学术官方微信