Abstract
Many dimensionality reduction techniques have been proposed for effective representation of time series data. Piecewise Aggregate Approximation (PAA) is one of the most popular methods for time series dimensionality reduction. While PAA approach allows a very good dimensionality reduction, PAA minimizes dimensionality by the mean values of equal sized frames. This mean value based representation may cause a high possibility to miss some important patterns in some time series datasets. In this work, we propose a new approach based on PAA, which we call Piecewise Linear Aggregate Approximation (PLAA). PLAA is the combination of a mean-based and a slope-based dimensionality reduction. We show that PLAA can improve representation preciseness through a better tightness of lower bound in comparison to PAA.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Faloutsos, C., Swami, A.N.: Efficient similarity search in sequence databases. In: The 4th Foundations of Data Organization and Algorithms, pp. 69–84. Springer, Heidelberg (1993)
Chan, K., Fu, W.: Efficient time series matching by wavelets. In: The15th IEEE International Conference on Data Engineering, pp. 126–133. IEEE Press, Los Alamitos (1999)
Faloutsos, C., Ranganathan, M., Manolopoulus, Y.: Fast Subsequence Matching in Time Series Databases. In: The 1994 ACM SIGMOD Conference On Management of Data, pp. 419–429. ACM, New York (1994)
Han, W.S., Lee, J., Moon, Y.S., Jiang, H.: Ranked Subsequence Matching in Time-Series Databases. In: The 33rd International Conference on Very Large Data Bases, pp. 423–434. ACM, New York (2007)
Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases. In: Knowledge and Information Systems, vol. 3(3), pp. 263–286. Springer, Heidelberg (2001)
Keogh, E., Chu, S., Hart, D., Pazzani, M.: An Online Algorithm for Segmenting Time Series. In: IEEE International Conference on Data Mining, pp. 289–296. IEEE Press, Los Alamitos (2001)
Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Locally adaptive dimensionality reduction for indexing large time series databases. In: ACM SIGMOD Conference on Management of Data, pp. 151–162. ACM, New York (2001)
Lin, J., Keogh, E., Lonardi, S., Chiu, B.: A Symbolic Representation of Time Series, with Implications for Streaming Algorithms. In: The 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discover, pp. 2–11. ACM, New York (2003)
Lkhagva, B., Suzuki, Y., Kawagoe, K.: New Time Series Data Representation ESAX for Financial Applications. In: 22nd International Conference on Data Engineering Workshops, p. 155. IEEE Press, Los Alamitos (2006)
Time Series Stock Data, http://www-cs.ucr.edu/~wli/FilteringData/stock.zip
Toshniwal, D., Joshi, R.C.: Finding Similarity in Time Series Data by Method of Time Weighted Moments. In: The 16th Australasian Database Conference, pp. 155–164. IEEE Press, Los Alamitos (2005)
Yi, B.K., Faloutsos, C.: Fast Time Sequence Indexing for Arbitrary Lp Norms. In: The 26th International Conference on Very Large Data Bases, pp. 285–394. ACM, New York (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hung, N.Q.V., Anh, D.T. (2008). An Improvement of PAA for Dimensionality Reduction in Large Time Series Databases. In: Ho, TB., Zhou, ZH. (eds) PRICAI 2008: Trends in Artificial Intelligence. PRICAI 2008. Lecture Notes in Computer Science(), vol 5351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89197-0_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-89197-0_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89196-3
Online ISBN: 978-3-540-89197-0
eBook Packages: Computer ScienceComputer Science (R0)