Searching and mining trillions of time series subsequences under dynamic time warping
University of California, Riverside · Universidade de São Paulo · +1 more institution
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
- FWCI
- 46.05
- Percentile
- 100%
- References
- 42
Authors
8Topics & keywords
- Computer science
- Dynamic time warping
- Data mining
- Time series
- Series (stratigraphy)
- Cluster analysis
- Nearest neighbor search
- Bottleneck
- Industry, innovation and infrastructure