The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Fundamentals of speech recognition
Fundamentals of speech recognition
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
A comparison of DFT and DWT based similarity search in time-series databases
Proceedings of the ninth international conference on Information and knowledge management
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases
Proceedings of the 17th International Conference on Data Engineering
Similarity Search for Multidimensional Data Sequences
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
| Hi-index | 0.01 |
The filtering method is currently the most suitable approach for the fast retrieval of similar sequences under the time-warping distance. Several filtering methods under the time-warping distance have been proposed, but they are only for real number sequences. This paper presents an efficient filtering method for the retrieval of similar multidimensional sequences. First, we propose three basic filtering measures (the end-point distance, the min-region distance, and the interim time-warping distance) based on the ones appeared in the literature, and one of their direct combinations (the point-region distance). Next, we investigate their problems with a large number of multidimensional sequences. In order to alleviate those problems, we extend the end-point distance and the min-region distance into the extended end-point distance and the segmented min-region distance, respectively, and combine them into a novel measure, the extended point-region distance. A multi-step architecture is adopted to implement the retrieval process with the proposed measure. Experiments with synthetic sequences are conducted for the performance comparison.