Sciweavers

21 search results - page 2 / 5
» Finding the most unusual time series subsequence: algorithms...
Sort
View
SDM
2007
SIAM
149views Data Mining» more  SDM 2007»
13 years 6 months ago
WAT: Finding Top-K Discords in Time Series Database
Finding discords in time series database is an important problem in a great variety of applications, such as space shuttle telemetry, mechanical industry, biomedicine, and financ...
Yingyi Bu, Oscar Tat-Wing Leung, Ada Wai-Chee Fu, ...
VLDB
2007
ACM
121views Database» more  VLDB 2007»
14 years 5 months ago
Ranked Subsequence Matching in Time-Series Databases
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
Wook-Shin Han, Jinsoo Lee, Yang-Sae Moon, Haifeng ...
ADMA
2006
Springer
112views Data Mining» more  ADMA 2006»
13 years 11 months ago
Finding Time Series Discords Based on Haar Transform
The problem of finding anomaly has received much attention recently. However, most of the anomaly detection algorithms depend on an explicit definition of anomaly, which may be i...
Ada Wai-Chee Fu, Oscar Tat-Wing Leung, Eamonn J. K...
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
13 years 8 months ago
Mining asynchronous periodic patterns in time series data
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...
Jiong Yang, Wei Wang 0010, Philip S. Yu
SIGMOD
2004
ACM
188views Database» more  SIGMOD 2004»
14 years 5 months ago
Online Event-driven Subsequence Matching over Financial Data Streams
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
Huanmei Wu, Betty Salzberg, Donghui Zhang