Mining motifs in massive time series databases
Authors:
- 26 June 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 370-377
Abstract
The problem of efficiently locating previously known patterns in a time series database (i.e., query by content) has received much attention and may now largely be regarded as a solved problem. However, from a knowledge discovery viewpoint, a more interesting problem is the enumeration of previously unknown, frequently occurring patterns. We call such patterns "motifs", because of their close analogy to their discrete counterparts in computation biology. An efficient motif discovery algorithm for time series would be useful as a tool for summarizing and visualizing massive time series databases. In addition it could be used as a subroutine in various other data mining tasks, including the discovery of association rules, clustering and classification. In this paper we carefully motivate, then introduce, a nontrivial definition of time series motifs. We propose an efficient algorithm to discover them, and we demonstrate the utility and efficiency of our approach on several real world datasets.Keywords
This publication has 20 references indexed in Scilit:
- Mining the MACHO datasetComputer Physics Communications, 2001
- An Updated Bibliography of Temporal, Spatial, and Spatio-temporal Data Mining Research2001
- Deformable Markov model templates for time-series pattern matching2000
- Probabilistic and Statistical Properties of Words: An OverviewJournal of Computational Biology, 2000
- Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies 1 1Edited by G. von HeijneJournal of Molecular Biology, 1998
- Syntactic recognition of ECG signals by attributed finite automataPattern Recognition, 1995
- Detecting Subtle Sequence Signals: a Gibbs Sampling Strategy for Multiple AlignmentScience, 1993
- New techniques for best-match retrievalACM Transactions on Information Systems, 1990
- Methods for discovering novel motifs in nucleic acid sequencesBioinformatics, 1989
- Some approaches to best-match file searchingCommunications of the ACM, 1973