Dynamic programming algorithm optimization for spoken word recognition
Readings in speech recognition
Fundamentals of speech recognition
Fundamentals of speech recognition
Efficiently supporting ad hoc queries in large datasets of time sequences
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Approximate Queries and Representations for Large Data Sequences
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
An Online Algorithm for Segmenting Time Series
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Scaling up Dynamic Time Warping to Massive Dataset
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Knowledge-Based Event Detection in Complex Time Series Data
AIMDM '99 Proceedings of the Joint European Conference on Artificial Intelligence in Medicine and Medical Decision Making
Mining Asynchronous Periodic Patterns in Time Series Data
IEEE Transactions on Knowledge and Data Engineering
Fast Retrieval of Similar Subsequences in Long Sequence Databases
KDEX '99 Proceedings of the 1999 Workshop on Knowledge and Data Engineering Exchange
Efficient Time Series Matching by Wavelets
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
A symbolic representation of time series, with implications for streaming algorithms
DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Discovering all frequent trends in time series
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Optimal Piecewise-Linear Approximation Algorithms for Complex Dependencies
Automation and Remote Control
Exact indexing of dynamic time warping
Knowledge and Information Systems
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Linearly constrained global optimization via piecewise-linear approximation
Journal of Computational and Applied Mathematics
A performance comparison of piecewise linear estimation methods
Proceedings of the 2008 Spring simulation multiconference
Mining fuzzy frequent trends from time series
Expert Systems with Applications: An International Journal
An Improvement of PAA for Dimensionality Reduction in Large Time Series Databases
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Time series shapelets: a new primitive for data mining
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
A Time-Series Representation for Temporal Web Mining Using a Data Band Approach
Proceedings of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006
Mining closed patterns in multi-sequence time-series databases
Data & Knowledge Engineering
Group SAX: extending the notion of contrast sets to time series and multimedia data
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
A symbolic representation method to preserve the characteristic slope of time series
SBIA'12 Proceedings of the 21st Brazilian conference on Advances in Artificial Intelligence
Similarity search for time series based on efficient warping measure
DM-IKM '12 Proceedings of the Data Mining and Intelligent Knowledge Management Workshop
Asynchronism-based principal component analysis for time series data mining
Expert Systems with Applications: An International Journal
Hi-index | 12.05 |
We propose a new method to calculate the similarity of time series based on piecewise linear approximation (PLA) and derivative dynamic time warping (DDTW). The proposed method includes two phases. One is the divisive approach of piecewise linear approximation based on the middle curve of original time series. Apart from the attractive results, it can create line segments to approximate time series faster than conventional linear approximation. Meanwhile, high dimensional space can be reduced into a lower one and the line segments approximating the time series are used to calculate the similarity. In the other phase, we utilize the main idea of DDTW to provide another similarity measure based on the line segments just we got from the first phase. We empirically compare our new approach to other techniques and demonstrate its superiority.