Telecommunications Science ›› 2015, Vol. 31 ›› Issue (8): 63-71.doi: 10.11959/j.issn.1000-0801.2015196

• research and development • Previous Articles     Next Articles

An LSH Based Time Subsequence Matching Algorithm

Genping Liu,Yefang Chen,Chengtou Du,Jiangbo Qian   

  1. Faculty of Electrical and Computer Science,Ningbo University,Ningbo 315211,China
  • Online:2015-08-27 Published:2015-08-27
  • Supported by:
    The National Natural Science Foundation of China;The Natural Science Foundation of Zhejiang Province;The Natural Science Foundation of Ningbo City;The Natural Science Foundation of Ningbo City;Zhejiang Key Discipline Fund of Information and Communication Engineering

Abstract:

An algorithm called LSHSM,which uses locality sensitive hashing(LSH)to process time subsequence matching,was proposed.Different to the FRM and DualMatch algorithms,the LSHSM does not require feature transformation such as DFT and DWT.It just directly regards the sequence as a high-dimensional object to find similar subsequences.Comparing to a linear algorithm on three real datasets,the LSHSM algorithm demonstrates the effectiveness and efficiency.

Key words: time subsequence, locality sensitive hashing, match searching

No Suggested Reading articles found!