Sciweavers

42 search results - page 2 / 9
» Approximate embedding-based subsequence matching of time ser...
Sort
View
SIGMOD
1994
ACM
116views Database» more  SIGMOD 1994»
13 years 8 months ago
Fast Subsequence Matching in Time-Series Databases
Christos Faloutsos, M. Ranganathan, Yannis Manolop...
SIGMOD
2004
ACM
188views Database» more  SIGMOD 2004»
14 years 4 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
FSKD
2005
Springer
267views Fuzzy Logic» more  FSKD 2005»
13 years 10 months ago
Preventing Meaningless Stock Time Series Pattern Discovery by Changing Perceptually Important Point Detection
Discovery of interesting or frequently appearing time series patterns is one of the important tasks in various time series data mining applications. However, recent research critic...
Tak-Chung Fu, Fu-Lai Chung, Robert W. P. Luk, Chak...
CBMS
2005
IEEE
13 years 10 months ago
Approximations to Magic: Finding Unusual Medical Time Series
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...
Jessica Lin, Eamonn J. Keogh, Ada Wai-Chee Fu, Hel...
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...