Spikelet: An Adaptive Symbolic Approximation for Finding Higher-Level Structure in Time Series

Makoto Imamura, Takaaki Nakamura
{"title":"Spikelet: An Adaptive Symbolic Approximation for Finding Higher-Level Structure in Time Series","authors":"Makoto Imamura, Takaaki Nakamura","doi":"10.1109/ICDM51629.2021.00132","DOIUrl":null,"url":null,"abstract":"Time series motifs have become a fundamental tool to characterize repeated and conserved structures in systems, such as manufacturing, human behavior and economic activities. Recently the notion of semantic motif was introduced as a generalization of motifs that allows the capture of higher-level semantic structure. Sematic motifs are a very promising primitive; however, the original work characterizes a semantic motif with only two sub-patterns separated by a variable length don’t-care region, so it may fail to capture certain types of regularities embedded in a time series. To mitigate this weakness, we propose an adaptive, symbolic and spike-based approximation that allows overlapping segmentation, which we call spikelet. The adaptive and overlapping nature of our representation is more expressive, enabling it to capture both global and local characteristics of a conserved structure. Furthermore, the symbolic nature of our proposed representation enables us to reason about the “grammatical” structure of the data. With extensive empirical work, we show that spikelet-based algorithms are scalable enough for real-world datasets and enables us to find the higher-level structure that would otherwise escape our attention.","PeriodicalId":320970,"journal":{"name":"2021 IEEE International Conference on Data Mining (ICDM)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Data Mining (ICDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDM51629.2021.00132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Time series motifs have become a fundamental tool to characterize repeated and conserved structures in systems, such as manufacturing, human behavior and economic activities. Recently the notion of semantic motif was introduced as a generalization of motifs that allows the capture of higher-level semantic structure. Sematic motifs are a very promising primitive; however, the original work characterizes a semantic motif with only two sub-patterns separated by a variable length don’t-care region, so it may fail to capture certain types of regularities embedded in a time series. To mitigate this weakness, we propose an adaptive, symbolic and spike-based approximation that allows overlapping segmentation, which we call spikelet. The adaptive and overlapping nature of our representation is more expressive, enabling it to capture both global and local characteristics of a conserved structure. Furthermore, the symbolic nature of our proposed representation enables us to reason about the “grammatical” structure of the data. With extensive empirical work, we show that spikelet-based algorithms are scalable enough for real-world datasets and enables us to find the higher-level structure that would otherwise escape our attention.
小穗:在时间序列中寻找高级结构的自适应符号逼近
时间序列基序已经成为表征系统中重复和保守结构的基本工具,例如制造业、人类行为和经济活动。近年来引入了语义基序的概念,作为基序的一种概括,可以捕捉更高层次的语义结构。语义基元是一种很有前途的基元;然而,最初的工作特征是语义基序只有两个子模式,由可变长度的不关心区域分开,因此它可能无法捕获嵌入在时间序列中的某些类型的规律。为了缓解这一弱点,我们提出了一种自适应的,象征性的和基于穗的近似,允许重叠分割,我们称之为穗。我们的表征的适应性和重叠性更具有表现力,使其能够捕捉到一个保守结构的全局和局部特征。此外,我们提出的表征的符号性质使我们能够对数据的“语法”结构进行推理。通过广泛的实证研究,我们发现基于spikelet的算法对于现实世界的数据集具有足够的可扩展性,并使我们能够找到否则会逃避我们注意的更高级别的结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信