Efficient pattern matching of multidimensional sequences

  • Authors:
  • Sangjun Lee;Kyoungsu Oh;Dongseop Kwon;Wonik Choi;Jiman Hong;Jongmoo Choi;Donghee Lee

  • Affiliations:
  • Soongsil University;Soongsil University;Seoul National University;Thinkware Systems Corporation;Kwangwoon University;Dankook University;University of Seoul

  • Venue:
  • RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We address the problem of the similarity search in large multidimensional sequence databases. Most of previous work focused on similarity matching and retrieval of one-dimensional sequences. However, many new applications such as weather data or music databases need to handle multidimensional sequences. In this paper, we present the efficient search method for finding similar sequences to a given query sequence in multidimensional sequence databases. The proposed method can efficiently reduce the search space and guarantees no false dismissals. We give preliminary experimental results to show the effectiveness of the proposed method.