This paper investigates the subsequence searching problem under time warping in sequence databases. Time warping enables to find sequences with similar changing patterns even when they are of different lengths. Our work is motivated by the observation that subsequence searches slow down quadratically as the total length of data sequences increases. To resolve this problem, we propose the Segment-Based Approach for Subsequence Searches (SBASS), which modifies the similarity measure from time warping to piece-wise time warping and limits the number of possible subsequences to be compared with a query sequence. For efficient retrieval of similar subsequences, we extract feature vectors from all data segments exploiting their mono-tonically changing properties, and build a multi-dimensional index such as R-tree or R∗-tree. Using this index, queries are processed with four steps: 1) index filtering, 2) feature filtering, 3) successor filtering, and 4) post-processing. The effectiveness of our approach is verified through experiments on synthetic data sets.
|Title of host publication||Proceedings of the 2001 ACM Symposium on Applied Computing, SAC 2001|
|Publisher||Association for Computing Machinery|
|Number of pages||5|
|ISBN (Print)||1581132875, 9781581132878|
|Publication status||Published - 2001 Mar 1|
|Event||2001 ACM Symposium on Applied Computing, SAC 2001 - Las Vegas, United States|
Duration: 2001 Mar 11 → 2001 Mar 14
|Name||Proceedings of the ACM Symposium on Applied Computing|
|Other||2001 ACM Symposium on Applied Computing, SAC 2001|
|Period||01/3/11 → 01/3/14|
Bibliographical noteFunding Information:
This research was supported in part by NSF grant (IRJ-9619345), NIH grant (P01CA51198), and the 2000 Basic Research Program (Grant No. 20001-51200-006-1) of the KOSEF (Korea Science and Engineering Foundation). Sang-Wook Kim would also like to thank Jung-Hee Seo, Suk-Yeon Hwang, and Grace(Ju-Young) Kim for their encouragement and support.
© 2001 ACM.
All Science Journal Classification (ASJC) codes