10 search results - page 1 / 2 » Efficient Online Subsequence Searching in Data Streams under... |
ICDE
2008
IEEE
14 years 5 months ago
2008
IEEE
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 ...
PAKDD
2010
ACM
13 years 9 months ago
2010
ACM
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...
KDD
2012
ACM
11 years 6 months ago
2012
ACM
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...
ICDE
2007
IEEE
14 years 5 months ago
2007
IEEE
The goal of this paper is to monitor numerical streams, and to find subsequences that are similar to a given query sequence, under the DTW (Dynamic Time Warping) distance. Applica...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
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 ...