基于有限长度后缀阵列的时间序列可变长度基元发现方法

IF 0.9 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal of Internet Technology Pub Date : 2018-11-01 DOI:10.3966/160792642018111906020

Le Sun, Jinyuan He, Jiangang Ma, Hai Dong, Yanchun Zhang

{"title":"基于有限长度后缀阵列的时间序列可变长度基元发现方法","authors":"Le Sun, Jinyuan He, Jiangang Ma, Hai Dong, Yanchun Zhang","doi":"10.3966/160792642018111906020","DOIUrl":null,"url":null,"abstract":"In this paper, we explore two key problems in time series motif discovery: releasing the constraints of trivial matching between subsequences with different lengths and improving the time and space efficiency. The purpose of avoiding trivial matching is to avoid too much repetition between subsequences in calculating their similarities. We describe a limited-length enhanced suffix array based framework (LiSAM) to resolve the two problems. Experimental results on Electrocardiogram signals indicate the accuracy of LiSAM on finding motifs with different lengths.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"19 1","pages":"1841-1851"},"PeriodicalIF":0.9000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Limited-length Suffix-array-based Method for Variable-length Motif Discovery in Time Series\",\"authors\":\"Le Sun, Jinyuan He, Jiangang Ma, Hai Dong, Yanchun Zhang\",\"doi\":\"10.3966/160792642018111906020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we explore two key problems in time series motif discovery: releasing the constraints of trivial matching between subsequences with different lengths and improving the time and space efficiency. The purpose of avoiding trivial matching is to avoid too much repetition between subsequences in calculating their similarities. We describe a limited-length enhanced suffix array based framework (LiSAM) to resolve the two problems. Experimental results on Electrocardiogram signals indicate the accuracy of LiSAM on finding motifs with different lengths.\",\"PeriodicalId\":50172,\"journal\":{\"name\":\"Journal of Internet Technology\",\"volume\":\"19 1\",\"pages\":\"1841-1851\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Internet Technology\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.3966/160792642018111906020\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Internet Technology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3966/160792642018111906020","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 1

摘要

在本文中，我们探讨了时间序列基序发现的两个关键问题：释放不同长度子序列之间平凡匹配的约束和提高时间和空间效率。避免琐碎匹配的目的是避免在计算子序列的相似性时子序列之间有太多重复。我们描述了一个基于有限长度增强后缀数组的框架（LiSAM）来解决这两个问题。心电图信号的实验结果表明了LiSAM在寻找不同长度基序方面的准确性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Limited-length Suffix-array-based Method for Variable-length Motif Discovery in Time Series

In this paper, we explore two key problems in time series motif discovery: releasing the constraints of trivial matching between subsequences with different lengths and improving the time and space efficiency. The purpose of avoiding trivial matching is to avoid too much repetition between subsequences in calculating their similarities. We describe a limited-length enhanced suffix array based framework (LiSAM) to resolve the two problems. Experimental results on Electrocardiogram signals indicate the accuracy of LiSAM on finding motifs with different lengths.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Internet Technology COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS

CiteScore

3.20

自引率

18.80%

发文量

112

审稿时长

13.8 months

期刊介绍： The Journal of Internet Technology accepts original technical articles in all disciplines of Internet Technology & Applications. Manuscripts are submitted for review with the understanding that they have not been published elsewhere. Topics of interest to JIT include but not limited to: Broadband Networks Electronic service systems (Internet, Intranet, Extranet, E-Commerce, E-Business) Network Management Network Operating System (NOS) Intelligent systems engineering Government or Staff Jobs Computerization National Information Policy Multimedia systems Network Behavior Modeling Wireless/Satellite Communication Digital Library Distance Learning Internet/WWW Applications Telecommunication Networks Security in Networks and Systems Cloud Computing Internet of Things (IoT) IPv6 related topics are especially welcome.