An LSH Based Time Subsequence Matching Algorithm

An LSH Based Time Subsequence Matching Algorithm

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Genping Liu, Yefang Chen, Chengtou Du, Jiangbo Qian
Format: Article
Language:zho
Published: Beijing Xintong Media Co., Ltd 2015-08-01
Series:Dianxin kexue
Subjects:
time subsequence
locality sensitive hashing
match searching
Online Access:http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2015196/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1000-0801

Similar Items