Sciweavers

19 search results - page 3 / 4
» Fast Subsequence Matching in Time-Series Databases
Sort
View
PETRA
2009
ACM
13 years 11 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
ICDE
2005
IEEE
185views Database» more  ICDE 2005»
14 years 6 months ago
A Multiresolution Symbolic Representation of Time Series
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
Vasileios Megalooikonomou, Qiang Wang, Guo Li, Chr...
CIKM
1998
Springer
13 years 9 months ago
Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
Yunyao Qu, Changzhou Wang, Xiaoyang Sean Wang
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 5 months ago
An efficient and accurate method for evaluating time series similarity
A variety of techniques currently exist for measuring the similarity between time series datasets. Of these techniques, the methods whose matching criteria is bounded by a specifi...
Michael D. Morse, Jignesh M. Patel
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 5 months ago
Similarity Search on Time Series Based on Threshold Queries
Similarity search in time series data is required in many application fields. The most prominent work has focused on similarity search considering either complete time series or si...
Johannes Aßfalg, Hans-Peter Kriegel, Peer Kr...