Exact Discovery of Length-Range Motifs

@inproceedings{Mohammad2014ExactDO,
  title={Exact Discovery of Length-Range Motifs},
  author={Yasser F. O. Mohammad and Toyoaki Nishida},
  booktitle={ACIIDS},
  year={2014}
}
Motif discovery is the problem of finding unknown patterns that appear frequently in real valued timeseries. Several approaches have been proposed to solve this problem with no a-priori knowledge of the timeseries or motif characteristics. MK algorithm is the de facto standard exact motif discovery algorithm but it can discover a single motif of a known length. In this paper, we argue that it is not trivial to extend this algorithm to handle multiple motifs of variable lengths when constraints… CONTINUE READING
BETA

Similar Papers

Figures, Tables, and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 15 CITATIONS

Intelligent Information and Database Systems

  • Lecture Notes in Computer Science
  • 2019
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Exploring variable-length time series motifs in one hundred million length scale

  • Data Mining and Knowledge Discovery
  • 2018
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

HIME: discovering variable-length motifs in large-scale time series

  • Knowledge and Information Systems
  • 2018
VIEW 1 EXCERPT
CITES RESULTS

Efficient discovery of time series motifs with large length range in million scale time series

  • 2017 IEEE International Conference on Data Mining (ICDM)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Constrained Motif Discovery in Time Series

  • New Generation Computing
  • 2009
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Unsupervised discovery of basic human actions from activity recording datasets

  • 2012 IEEE/SICE International Symposium on System Integration (SII)
  • 2012
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Learning interaction protocols using Augmented Baysian Networks applied to guided navigation

  • 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems
  • 2010
VIEW 3 EXCERPTS

HOT SAX: efficiently finding the most unusual time series subsequence

  • Fifth IEEE International Conference on Data Mining (ICDM'05)
  • 2005
VIEW 1 EXCERPT