The Community for Technology Leaders
Green Image
Issue No. 04 - April (2009 vol. 21)
ISSN: 1041-4347
pp: 568-581
Xiang Lian , Hong Kong University of Science and Technology, Hong Kong
Lei Chen , Hong Kong University of Science and Technology, Hong Kong
Jeffrey Xu Yu , The Chinese University of Hong Kong, Hong Kong
Jinsong Han , Hong Kong University of Science and Technology, Hong Kong
Jian Ma , Nokia Research Center, Beijing
Similarity-based time series retrieval has been a subject of long term study due to its wide usage in many applications, such as financial data analysis and weather data forecasting. Its original task was to find those time series similar to a pattern time series data, where both the pattern and data time series are static. Recently, with an increasing demand on stream data management, similarity-based stream time series retrieval has raised new research issues due to its unique requirements during the stream processing, such as one-pass search and fast response. In this paper, we address the problem of matching both static and dynamic patterns over stream time series data. We will develop a novel multi-scale representation, called multi-scale segment mean (MSM), for stream time series data, which can be incrementally computed and thus perfectly adapted to the stream characteristics. Most importantly, we propose a novel multi-step filtering mechanism, SS, over the multi-scale representation. Analysis indicates that the mechanism can greatly prune the search space and thus offer fast response. Furthermore, batching processing optimization, the dynamic case where patterns are also from stream time series, and pattern matching over future stream time series are also discussed. Extensive experiments show the proposed scheme can efficiently filter out false candidates and detect patterns.
Information Storage and Retrieval, Temporal databases

X. Lian, J. Ma, L. Chen, J. Han and J. X. Yu, "Multiscale Representations for Fast Pattern Matching in Stream Time Series," in IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 568-581, 2008.
81 ms
(Ver 3.3 (11022016))