Affiliated with RCfalse
Fast subsequence search on time series data
Yuhong Li1; Bo Tang2; Leong Hou U1; Man Lung Yiu2; Zhiguo Gong1
Conference Name20th International Conference on Extending Database Technology (EDBT)
Source PublicationAdvances in Database Technology - EDBT
Conference DateMarch 21-24, 2017
Conference PlaceVenice, Italy

Many applications on time series data require solving the subsequence search problem, which has been extensively studied in the database and data mining communities. These applications are computation bound rather than disk I/O bound. In this work, we further propose effective and cheap lower-bounds to reduce the computation cost of the subsequence search problem. Experimental studies show that the proposed lower-bounds can boost the performance of the state-of-the-art solution by up to an order of magnitude.

URLView the original
Fulltext Access
Citation statistics
Document TypeConference paper
Affiliation1.Department of Computer and Information Science, University of Macau
2.Department of Computing, Hong Kong Polytechnic University
First Author AffilicationUniversity of Macau
Recommended Citation
GB/T 7714
Yuhong Li,Bo Tang,Leong Hou U,et al. Fast subsequence search on time series data[C],2017:514-517.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yuhong Li]'s Articles
[Bo Tang]'s Articles
[Leong Hou U]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yuhong Li]'s Articles
[Bo Tang]'s Articles
[Leong Hou U]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yuhong Li]'s Articles
[Bo Tang]'s Articles
[Leong Hou U]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.