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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2015-08-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| 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!
|
Be the first to leave a comment!