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

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

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.


Citation Format:
Le Sun, Jinyuan He, Jiangang Ma, Hai Dong, Yanchun Zhang, "Limited-length Suffix-array-based Method for Variable-length Motif Discovery in Time Series," Journal of Internet Technology, vol. 19, no. 6 , pp. 1841-1851, Nov. 2018.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.





Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314  E-mail: jit.editorial@gmail.com