Identifying distinctive subsequences in multivariate time series by clustering
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition
Combinatorial Approaches to Finding Subtle Signals in DNA Sequences
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Spelling Approximate Repeated or Common Motifs Using a Suffix Tree
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
A Method for Clustering the Experiences of a Mobile Robot that Accords with Human Judgments
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
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
Probabilistic discovery of time series motifs
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Detecting time series motifs under uniform scaling
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
iSAX: indexing and mining terabyte sized time series
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Improving activity discovery with automatic neighborhood estimation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Toward unsupervised activity discovery using multi-dimensional motif detection in time series
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Discovering patterns in real-valued time series
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
| Hi-index | 0.00 |
We introduce an algorithm, MD-RP, for unsupervised discovery of frequently occurring patterns, or motifs, in time series databases. Unlike prior approaches that can handle pattern distortion in the time dimension only, MD-RP is robust at finding pattern instances with amplitude shifting and with amplitude scaling. Using an established discretization method, SAX, we augment the existing real-valued time series representation with additional features to capture shifting and scaling. We evaluate our representation change on the modified randomized projection algorithm on synthetic data with planted, known motifs and on real-world data with known motifs (e.g., GPS). The empirical results demonstrate the effectiveness of MD-RP at discovering motifs that are undiscoverable by prior approaches. Finally, we show that MD-RP can be used to find subsequences of time series that are the least similar to all other subsequences.