Method of shapelet discovery for time series ordinal classification

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Siyuan Jing, Jun Yang
{"title":"Method of shapelet discovery for time series ordinal classification","authors":"Siyuan Jing, Jun Yang","doi":"10.1007/s00500-024-09928-0","DOIUrl":null,"url":null,"abstract":"<p>Current methods for time series ordinal classification (TSOC) methods suffer from low efficiency because the measures used to evaluate the quality of the shapelet need to calculate Information Gain from the Euclidian distances between the shapelet and time series, which incurs tremendous computation for large datasets. This paper introduces a novel method of shapelet discovery for TSOC in which a new measure is adopted, which takes into account the coverage concentration and dominance of shapelet on SAX-represented time series datasets. Moreover, a trie-tree is constructed based on all candidate shapelets and aims to discover a diverse set of high-quality shapelets. The experimental results demonstrated the effectiveness and efficiency when compared to eight SOTA algorithms for time series classification/ordinal classification.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"34 1","pages":""},"PeriodicalIF":3.1000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00500-024-09928-0","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Current methods for time series ordinal classification (TSOC) methods suffer from low efficiency because the measures used to evaluate the quality of the shapelet need to calculate Information Gain from the Euclidian distances between the shapelet and time series, which incurs tremendous computation for large datasets. This paper introduces a novel method of shapelet discovery for TSOC in which a new measure is adopted, which takes into account the coverage concentration and dominance of shapelet on SAX-represented time series datasets. Moreover, a trie-tree is constructed based on all candidate shapelets and aims to discover a diverse set of high-quality shapelets. The experimental results demonstrated the effectiveness and efficiency when compared to eight SOTA algorithms for time series classification/ordinal classification.

Abstract Image

用于时间序列序数分类的小形发现方法
目前用于时间序列序数分类(TSOC)的方法效率较低,因为用于评估形状子质量的方法需要根据形状子与时间序列之间的欧几里得距离计算信息增益(Information Gain),这对于大型数据集来说需要大量计算。本文介绍了一种用于 TSOC 的新的小形发现方法,其中采用了一种新的测量方法,该方法考虑了小形在 SAX 表示的时间序列数据集上的覆盖集中度和主导地位。此外,还根据所有候选小形构建了一个三叉树,旨在发现一组多样化的高质量小形。实验结果表明,与八种 SOTA 算法相比,该算法在时间序列分类/顺序分类方面效果显著、效率高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Soft Computing
Soft Computing 工程技术-计算机:跨学科应用
CiteScore
8.10
自引率
9.80%
发文量
927
审稿时长
7.3 months
期刊介绍: Soft Computing is dedicated to system solutions based on soft computing techniques. It provides rapid dissemination of important results in soft computing technologies, a fusion of research in evolutionary algorithms and genetic programming, neural science and neural net systems, fuzzy set theory and fuzzy systems, and chaos theory and chaotic systems. Soft Computing encourages the integration of soft computing techniques and tools into both everyday and advanced applications. By linking the ideas and techniques of soft computing with other disciplines, the journal serves as a unifying platform that fosters comparisons, extensions, and new applications. As a result, the journal is an international forum for all scientists and engineers engaged in research and development in this fast growing field.
×
引用
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学术官方微信