Sciweavers

Share
19 search results - page 1 / 4
» Searching and mining trillions of time series subsequences u...
Sort
View
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
8 years 1 months ago
Searching and mining trillions of time series subsequences under dynamic time warping
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 d...
Thanawin Rakthanmanon, Bilson J. L. Campana, Abdul...
ICDM
2010
IEEE
276views Data Mining» more  ICDM 2010»
9 years 8 months ago
Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...
Doruk Sart, Abdullah Mueen, Walid A. Najjar, Eamon...
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
10 years 12 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
10 years 10 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
PAKDD
2010
ACM
189views Data Mining» more  PAKDD 2010»
10 years 3 months ago
Subsequence Matching of Stream Synopses under the Time Warping Distance
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
Su-Chen Lin, Mi-Yen Yeh, Ming-Syan Chen
books