2009 FindingTimeSeriesMotifsInD

• (Mueen et al., 2009) ⇒ Abdullah Mueen, Eamonn J. Keogh, and Nima Bigdely Shamlo. (2009). “Finding Time Series Motifs in Disk-Resident Data.” In: Proceedings of the Ninth IEEE International Conference on Data Mining (ICDM 2009). doi:10.1109/ICDM.2009.15

Subject Headings: Time Series Motif.

Quotes

Abstract

Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data mining algorithms including classification, clustering, rule-discovery and summarization. In spite of extensive research in recent years, finding exact time series motifs in massive databases is an open problem. Previous efforts either found approximate motifs or considered relatively small datasets residing in main memory. In this work, we describe for the first time a disk-aware algorithm to find exact time series motifs in multi-gigabyte databases which contain on the order of tens of millions of time series. We have evaluated our algorithm on datasets from diverse areas including medicine, anthropology, computer networking and image processing and show that we can find interesting and meaningful motifs in datasets that are many orders of magnitude larger than anything considered before.

---

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2009 FindingTimeSeriesMotifsInD	Eamonn Keogh Abdullah Mueen Nima Bigdely Shamlo			Finding Time Series Motifs in Disk-Resident Data		ICDM 2009 Proceedings	http://www.cs.ucr.edu/~eamonn/ICDM2009.pdf	10.1109/ICDM.2009.15		2009