Sciweavers

111 search results - page 8 / 23
» On Similarity-Based Queries for Time Series Data
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 7 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...
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
13 years 11 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
14 years 1 months ago
Disk Aware Discord Discovery: Finding Unusual Time Series in Terabyte Sized Datasets
The problem of finding unusual time series has recently attracted much attention, and several promising methods are now in the literature. However, virtually all proposed methods...
Dragomir Yankov, Eamonn J. Keogh, Umaa Rebbapragad...
DATAMINE
2007
135views more  DATAMINE 2007»
13 years 7 months ago
Experiencing SAX: a novel symbolic representation of time series
Many high level representations of time series have been proposed for data mining, including Fourier transforms, wavelets, eigenwaves, piecewise polynomial models etc. Many researc...
Jessica Lin, Eamonn J. Keogh, Li Wei, Stefano Lona...
DBA
2006
236views Database» more  DBA 2006»
13 years 8 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...