A comparison of DFT and DWT based similarity search in time-series databases
Proceedings of the ninth international conference on Information and knowledge management
Segment-based approach for subsequence searches in sequence databases
Proceedings of the 2001 ACM symposium on Applied computing
Proceedings of the tenth international conference on Information and knowledge management
Shape-based retrieval of similar subsequences in time-series databases
Proceedings of the 2002 ACM symposium on Applied computing
General match: a subsequence matching method in time-series databases based on generalized windows
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Aggregation and comparison of trajectories
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
MDIC '01 Proceedings of the Second International Workshop on Multimedia Databases and Image Communication
Discovering and Matching Elastic Rules from Sequence Databases
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Mining Sequence Patterns from Wind Tunnel Experimental Data for Flight Control
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Efficient Pattern Matching of Time Series Data
IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
Efficient Similarity Search for Time Series Data Based on the Minimum Distance
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
On the need for time series data mining benchmarks: a survey and empirical demonstration
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Finding surprising patterns in a time series database in linear time and space
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration
Data Mining and Knowledge Discovery
Indexing multi-dimensional time-series with support for multiple distance measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Minimum distance queries for time series data
Journal of Systems and Software
Optimizing Similarity Search for Arbitrary Length Time Series Queries
IEEE Transactions on Knowledge and Data Engineering
Efficient K-NN search in polyphonic music databases using a lower bounding mechanism
MIR '03 Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval
A novel technique for indexing video surveillance data
IWVS '03 First ACM SIGMM international workshop on Video surveillance
Information Systems - Databases: Creation, management and utilization
Visually mining and monitoring massive time series
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Bounded similarity querying for time-series data
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Exact indexing of dynamic time warping
Knowledge and Information Systems
A Multiresolution Symbolic Representation of Time Series
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Optimization of subsequence matching under time warping in time-series databases
Proceedings of the 2005 ACM symposium on Applied computing
A segment-wise time warping method for time scaling searching
Information Sciences—Informatics and Computer Science: An International Journal
Visualizing and discovering non-trivial patterns in large time series databases
Information Visualization
Shape-based retrieval in time-series databases
Journal of Systems and Software
Indexing Multidimensional Time-Series
The VLDB Journal — The International Journal on Very Large Data Bases
Quantizing time series for efficient similarity search under time warping
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Discovering and Matching Elastic Rules from Sequence Databases
Fundamenta Informaticae - Intelligent Systems
Prefix-querying with anL1 distance metric for time-series subsequence matching under time warping
Journal of Information Science
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Using multiple indexes for efficient subsequence matching in time-series databases
Information Sciences: an International Journal
Indexing large human-motion databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Trajectory retrieval with latent semantic analysis
Proceedings of the 2008 ACM symposium on Applied computing
Similarity Search Algorithm for Efficient Sub-trajectory Matching in Moving Databases
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
A stock recommendation system exploiting rule discovery in stock databases
Information and Software Technology
Discovering hybrid temporal patterns from sequences consisting of point- and interval-based events
Data & Knowledge Engineering
Neighborhood counting for financial time series forecasting
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Bounded similarity querying for time-series data
Information and Computation
A segment-wise time warping method for time scaling searching
Information Sciences: an International Journal
Efficient similar trajectory-based retrieval for moving objects in video databases
CIVR'03 Proceedings of the 2nd international conference on Image and video retrieval
Histogram distance for similarity search in large time series database
IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
A review on time series data mining
Engineering Applications of Artificial Intelligence
Boundary-based lower-bound functions for dynamic time warping and their indexing
Information Sciences: an International Journal
Trajectory-Based video retrieval for multimedia information systems
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
An index-based method for timestamped event sequence matching
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Discovering key sequences in time series data for pattern classification
ICDM'06 Proceedings of the 6th Industrial Conference on Data Mining conference on Advances in Data Mining: applications in Medicine, Web Mining, Marketing, Image and Signal Mining
Discovering and Matching Elastic Rules from Sequence Databases
Fundamenta Informaticae - Intelligent Systems
ACM Computing Surveys (CSUR)
Similarity search over incomplete symbolic sequences
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Parallel processing for stepwise generalisation method on multi-core PC cluster
International Journal of Knowledge and Web Intelligence
OBST-based segmentation approach to financial time series
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
We propose an indexing technique for fast retrieval of similar subsequences using time warping distances. A time warping distance is a more suitable similarity measure than the Euclidean distance in many applications, where sequences may be of different lengths or different sampling rates. Our indexing technique uses a disk-based suffix tree as an index structure and employs lower-bound distance functions to filter out dissimilar subsequences without false dismissals. To make the index structure compact and thus accelerate the query processing, we convert sequences of continuous values to sequences of discrete values via a categorization method and store only a subset of suffixes whose first values are different from their preceding values. The experimental results reveal that our proposed technique can be a few orders of magnitude faster than sequential scanning.