Similarity search of time-warped subsequences via a suffix tree

  • Authors:

  • Sanghyun Park;Wesley W. Chu;Jeehee Yoon;Jungim Won

  • Affiliations:

  • Department of Computer Science and Engineering, Pohang University of Science and Technology (POSTECH), Pohang, South Korea;Department of Computer Science, University of California at Los Angeles (UCLA);Division of Information and Communication Engineering, Hallym University, South Korea;Division of Information and Communication Engineering, Hallym University, South Korea

  • Venue:
  • Information Systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes an indexing technique for fast retrieval of similar subsequences using the time-warping distance. The time-warping distance is a more suitable similarity measure than the Euclidean distance in many applications where sequences may be of different lengths and/or different sampling rates. The proposed indexing technique employs a disk-based suffix tree as an index structure and uses lower-bound distance functions to filter out dissimilar subsequences without false dismissals. To make the index structure compact and hence accelerate the query processing, it converts sequences in the continuous domain into sequences in the discrete domain and stores only a subset of the suffixes whose first values are different from those of the immediately preceding suffixes. Extensive experiments with real and synthetic data sequences revealed that the proposed approach significantly outperforms the sequential scan and LB scan approaches and scales well in a large volume of sequence databases.