Sciweavers

13 search results - page 2 / 3
» Ranked Subsequence Matching in Time-Series Databases
Sort
View
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
14 years 6 months ago
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
Yueguo Chen, Gang Chen, Ke Chen, Beng Chin Ooi
ICDE
2007
IEEE
183views Database» more  ICDE 2007»
14 years 6 months ago
SpADe: On Shape-based Pattern Detection in Streaming Time Series
Monitoring predefined patterns in streaming time series is useful to applications such as trend-related analysis, sensor networks and video surveillance. Most current studies on s...
Yueguo Chen, Mario A. Nascimento, Beng Chin Ooi, A...
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...
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 4 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...
PETRA
2010
ACM
13 years 6 months ago
Benchmarking dynamic time warping for music retrieval
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of mus...
Jefrey Lijffijt, Panagiotis Papapetrou, Jaakko Hol...