Fundamentals of speech recognition
Fundamentals of speech recognition
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Similarity-based queries for time series data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Matching and indexing sequences of different lengths
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
A fast projection algorithm for sequence data searching
Data & Knowledge Engineering - Special issue: next generation information technologies and systems
Proceedings of the tenth international conference on Information and knowledge management
Efficient and robust feature extraction and pattern matching of time series by a lattice structure
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
Approximate Queries and Representations for Large Data Sequences
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Learning Comprehensible Descriptions of Multivariate Time Series
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Scaling up Dynamic Time Warping to Massive Dataset
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Fast Time Sequence Indexing for Arbitrary Lp Norms
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
On Similarity Queries for Time-Series Data: Constraint Specification and Implementation
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases
Proceedings of the 17th 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
Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Local feature extraction and its applications using a library of bases
Local feature extraction and its applications using a library of bases
Supervised classification with temporal data
Supervised classification with temporal data
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Fractals and Scaling In Finance: Discontinuity, Concentration, Risk
Fractals and Scaling In Finance: Discontinuity, Concentration, Risk
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
Artificial Intelligence in Medicine
SAGA: A novel signal alignment method based on genetic algorithm
Information Sciences: an International Journal
Asynchronism-based principal component analysis for time series data mining
Expert Systems with Applications: An International Journal
| Hi-index | 0.07 |
The technique of searching for similar patterns among time series data is very important in a wide range of applications. Among them, the time scaling searching is a hard problem that only a few works have tackled. By combining the advantages of a natural time scaling transformation and the dynamic time warping method, we propose a similarity measure that is more suitable for time scaling searching than any existing one. We then explain how to calculate the proposed segment-wise time warping (STW) distance using dynamic programming. In addition, we discuss the lower bound technique of STW distance and the corresponding index method. Through different experiments, we find that the index can greatly reduce the amount of data that must be retrieved, and will lead to great improvements of performance in large sequence database compared with a sequential search.