articleAug 12, 2012GREEN OA

Searching and mining trillions of time series subsequences under dynamic time warping

University of California, Riverside · Universidade de São Paulo · +1 more institution

PubMed
Indexed incrossrefpubmed

Abstract

Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series data mining algorithms. The difficulty of scaling search to large datasets largely explains why most academic work on time series data mining has plateaued at considering a few millions of time series objects, while much of industry and science sits on billions of time series objects waiting to be explored. In this work we show that by using a combination of four novel ideas we can search and mine truly massive time series for the first time. We demonstrate the following extremely unintuitive fact; in large datasets we can exactly…

Citation impact

1,031
total citations
FWCI
46.05
Percentile
100%
References
42
Citations per year

Authors

8

Topics & keywords

Keywords
  • Computer science
  • Dynamic time warping
  • Data mining
  • Time series
  • Series (stratigraphy)
  • Cluster analysis
  • Nearest neighbor search
  • Bottleneck
UN Sustainable Development Goals
  • Industry, innovation and infrastructure
No related works found for this paper.

Funding