Hybrid Lower-Dimensional Transformation for Similar Sequence Matching
スポンサーリンク
概要
- 論文の詳細を見る
Lower-dimensional transformations in similar sequence matching show different performance characteristics depending on the type of time-series data. In this paper we propose a hybrid approach that exploits multiple transformations at a time in a single hybrid index. This hybrid approach has advantages of exploiting the similar effect of using multiple transformations and reducing the index maintenance overhead. For this, we first propose a new notion of hybrid lower-dimensional transformation that extracts various features using different transformations. We next define the hybrid distance to compute the distance between the hybrid transformed points. We then formally prove that the hybrid approach performs similar sequence matching correctly. We also present the index building and similar sequence matching algorithms based on the hybrid transformation and distance. Experimental results show that our hybrid approach outperforms the single transformation-based approach.
- (社)電子情報通信学会の論文
- 2009-03-01
著者
-
Kim Jinho
Department Of Computer Science Kangwon National University
-
Moon Yang-sae
Department Of Computer Science Kangwon National University
関連論文
- Efficient Storage and Querying of Horizontal Tables Using a PIVOT Operation in Commercial Relational DBMSs
- Physical Database Design for Efficient Time-Series Similarity Search
- Fourier Magnitude-Based Privacy-Preserving Clustering on Time-Series Data
- Hybrid Lower-Dimensional Transformation for Similar Sequence Matching
- Fast Normalization-Transformed Subsequence Matching in Time-Series Databases(Data Mining)
- A Data Cleansing Method for Clustering Large-Scale Transaction Databases
- Linear Detrending Subsequence Matching in Time-Series Databases
- A Fast Divide-and-Conquer Algorithm for Indexing Human Genome Sequences