This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generalized Dimension-Reduction Framework for Recent-Biased Time Series Analysis
February 2006 (vol. 18 no. 2)
pp. 231-244
Recent-biased approximations have received increased attention recently as a mechanism for learning trend patterns from time series or data streams. They have shown promise for clustering time series and incrementally pattern maintaining. In this paper, we design a generalized dimension-reduction framework for recent-biased approximations, aiming at making traditional dimension-reduction techniques actionable in recent-biased time series analysis. The framework is designed in two ways: equi-segmented scheme and vari-segmented scheme. In both schemes, time series data are first partitioned into segments and a dimension-reduction technique is applied to each segment. Then, more coefficients are kept for more recent data while fewer kept for older data. Thus, more details are preserved for recent data and fewer coefficients are kept for the whole time series, which improves the efficiency greatly. We experimentally evaluate the proposed approach, and demonstrate that traditional dimension-reduction techniques, such as SVD, DFT, DWT, PIP, PAA, and landmarks, can be embedded into our framework for recent-biased approximations over streaming time series.

[1] C.C. Aggarwal, J. Han, J. Wang, and P. Yu, “A Framework for Clustering Evolving Data Streams,” Proc. 29th Very Large Data Bases Conf., 2003.
[2] A. Bulut and A.K. Singh, “SWAT: Hierarchical Stream Summarization in Large Networks,” Proc. 19th Int'l Conf. Data Eng., Mar. 2003.
[3] Y. Chen, G. Dong, “Multi-Dimensional Regression Analysis of Time-Series Data Streams,” Proc. 2002 Int'l Conf. Very Large Data Bases (VLDB '02), 2002.
[4] K.-p. Chan and A.W.-c. Fu, “Efficient Time Series Matching by Wavelets,” Proc. Int'l Conf. Data Eng. (ICDE '99), Mar. 1999.
[5] F.K. Chan, A.W. Fu, and C. Yu, “Harr Wavelets for Efficient Similarity Search of Time-Series: with and without Time Warping,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 3, pp. 686-705, 2003.
[6] S. Chu, E. Keogh, D. Hart, and M. Pazzani, “Iterative Deepening Dynamic Time Warping for Time Series, ” Proc. 2002 IEEE Int'l Conf. Data Mining, Dec. 2002.
[7] T. Fu, T-c. Fu, F.l. Chung, V Ng, and R. Luk, “Pattern Discovery from Stock Time Series Using Self-Organizing Maps,” Notes KDD2001 Workshop Temporal Data Mining, pp. 27-37, Aug. 2001.
[8] E. Fink, K.B. Pratt, and H.S. Gandhi, “Indexing of Time Series by Major Minima and Maxima,” Proc. IEEE Int'l Conf. Systems, Man, and Cybernetics, 2003.
[9] M. Gavrilov, D. Anguelov, P. Indyk, and R. Motwani, “Mining the Stock Market: Which Measure Is Best?” Proc. Sixth Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp. 487-496, 2000.
[10] C. Giannella, J. Han, J. Pei, X. Yan, and P.S. Yu, “Mining Frequent Patterns in Data Streams at Multiple Time Granularities,” Data Mining: Next Generation Challenges and Future Directions, H. Kargupta, A. Joshi, K. Sivakumar, and Y. Yesha, eds., AAAI/MIT Press, 2003.
[11] D. Gunopulos and G. Das, “Time Series Similarity Measures,” Tutorial Notes Sixth Int'l Conf. Knowledge Discovery and Data Mining, pp. 243-307, 2000.
[12] A. Hinneburg, C. Aggarwal, and D. Keim, “What Is the Nearest Neighbor in High Dimensional Spaces?,” Proc. Int'l Conf. Very Large Data Bases, pp. 506-515, 2000.
[13] E. Keogh, K. Chakrabati, M. Pazzani, and S. Mehrota, “Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases,” Knowledge and Information Systems, vol. 3, no. 3, pp. 263-286, 2000.
[14] E.J. Keogh and M.J. Pazzani, “Deriative Dynamic Time Warping,” Proc. First SIAM Int'l Conf. Data Mining (SDM-2001), 2001.
[15] M. Kontaki and A.N. Papadopoulos, “Efficient Similarity Search in Streaming Time Sequences,” Proc. 16th IEEE Conf. Scientific and Statistical Database Management (SSDBM '04), pp. 63-72, 2004.
[16] E.J. Keogh and M.J. Pazzani, “An Enhanced Representation of Time Series which Allows Fast and Accurate Classification, Clustering and Relevance Feedback,” Proc. Fourth Int'l Conf. Knowledge Discovery and Data Mining (KDD '98), pp. 239-241, Aug. 1998.
[17] J. Lin, E. Keogh, and W. Truppel, “Clustering of Streaming Time Series Is Meaningless,” Proc. Eighth ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery, pp. 56-65, 2003
[18] F. Mörchen, “Time Series Feature Extraction for Data Mining Using DWT and DFT,” Technical Report no. 33, Math and Computer Science Dept., Philipps Univ., Marburg, Germany, 2003.
[19] T. Oates, L. Firoiu, and P. Cohen, “Clustering Time Series with Hidden Markov Models and Dynamic Time Warping,” Proc. Int'l Joint Conf. Artificial Intelligence Workshop Neural, Symbolic, and Reinforcement Learning Methods for Sequence Learning, pp. 17–21, 1999.
[20] T. Palpanas, M. Vlachos, E. Keogh, D. Gunopulos, and W. Truppel, “Online Amnesic Approximation of Streaming Time Series,” Proc. 20th Int'l Conf. Data Eng. Mar. 2004.
[21] C.-S. Perng, H. Wang, S.R. Zhang, and D.S. Parker, “Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases,” Proc. 16th Int'l Conf. Data Eng., Feb.–Mar. 2000.
[22] M. Vlachos, J. Lin, E. Keogh, and D. Gunopulos, “A Wavelet-Based Anytime Algorithm for K-Means Clustering of Time Series,” Proc. Workshop Clustering High Dimensionality Data and Its Applications, Third SIAM Int'l Conf. Data Mining, May 2003.
[23] B.-K. Yi and C. Faloutsos, “Fast Time Sequence Indexing for Arbitrary Lp Norms Source,” Proc. 26th Int'l Conf. Very Large Data Bases, pp. 385-394, 2000.

Index Terms:
Index Terms- Time series analysis, feature extraction or construction, data mining.
Citation:
Yanchang Zhao, Shichao Zhang, "Generalized Dimension-Reduction Framework for Recent-Biased Time Series Analysis," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 2, pp. 231-244, Feb. 2006, doi:10.1109/TKDE.2006.30
Usage of this product signifies your acceptance of the Terms of Use.