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!
|
| _version_ | 1841529642843897856 |
|---|---|
| author | Genping Liu Yefang Chen Chengtou Du Jiangbo Qian |
| author_facet | Genping Liu Yefang Chen Chengtou Du Jiangbo Qian |
| author_sort | Genping Liu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-be0a815fc2ba4caaa488a0a4ac1a3706 |
| institution | Kabale University |
| issn | 1000-0801 |
| language | zho |
| publishDate | 2015-08-01 |
| publisher | Beijing Xintong Media Co., Ltd |
| record_format | Article |
| series | Dianxin kexue |
| spelling | doaj-art-be0a815fc2ba4caaa488a0a4ac1a37062025-01-15T03:16:49ZzhoBeijing Xintong Media Co., LtdDianxin kexue1000-08012015-08-0131637159614190An LSH Based Time Subsequence Matching AlgorithmGenping LiuYefang ChenChengtou DuJiangbo QianAn 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.http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2015196/time subsequencelocality sensitive hashingmatch searching |
| spellingShingle | Genping Liu Yefang Chen Chengtou Du Jiangbo Qian An LSH Based Time Subsequence Matching Algorithm Dianxin kexue time subsequence locality sensitive hashing match searching |
| title | An LSH Based Time Subsequence Matching Algorithm |
| title_full | An LSH Based Time Subsequence Matching Algorithm |
| title_fullStr | An LSH Based Time Subsequence Matching Algorithm |
| title_full_unstemmed | An LSH Based Time Subsequence Matching Algorithm |
| title_short | An LSH Based Time Subsequence Matching Algorithm |
| title_sort | lsh based time subsequence matching algorithm |
| topic | time subsequence locality sensitive hashing match searching |
| url | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2015196/ |
| work_keys_str_mv | AT genpingliu anlshbasedtimesubsequencematchingalgorithm AT yefangchen anlshbasedtimesubsequencematchingalgorithm AT chengtoudu anlshbasedtimesubsequencematchingalgorithm AT jiangboqian anlshbasedtimesubsequencematchingalgorithm AT genpingliu lshbasedtimesubsequencematchingalgorithm AT yefangchen lshbasedtimesubsequencematchingalgorithm AT chengtoudu lshbasedtimesubsequencematchingalgorithm AT jiangboqian lshbasedtimesubsequencematchingalgorithm |