Abstract
We target at the growing topic of representing and searching time-series data. A new MABI (Moving Average Based Indexing) technique is proposed to improve the performance of the similarity searching in large time-series databases. Notions of Moving average and Euclidean distances are introduced to represent the time-series data and to measure the distance between two series. Based on the distance reducing rate relation theorem, the MABI technique has the ability to prune the unqualified sequences out quickly in similarity searches and to restrict the search to a much smaller range, compare to the data in question. Finally the paper reports some results of the experiment on a stock price data set, and shows the good performance of MABI method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Welch, D., Quinn, P.: (1999), http://wwwmacho.mcmaster.ca/Project/Overview/status.html
Chan, K., Fu, W.: Efficient time series matching by wavelets. In: Proceedings of the 15th IEEE International Conference on Data Engineering (1999)
Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra.: Dimensionality reduction for fast similarity search in large time series databases. Journal of Knowledge and Information Systems (2000)
Bently, J.L.: Multidimensional binary search trees used for associative searching. Comm. ACMÂ 18(9) (1975)
Robinson, J.T.: The K-D-B-tree : A search structure for large multidimensional dynamic indexes. In: Proc. of Intl. Conf. on Management of Data, ACM SIGMOD (1981)
Finkel, R.A., Bently, J.L.: Quad Trees: A data structure for retrieval on composite keys. Acta Informatica 4 (1974)
Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases. In: Proceedings of the 4th Conference on Foundations of Data Organization and Algorithms (1993)
Faloutsos, C., Lin, K.: Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: Proc. ACM SIGMOD Conf., pp. 163–174 (1995)
Kim, Y.I., Ryu, K.H., Park, Y.: Algorithms of improved multidimensional dynamic index for the time-series pattern. In: Proc. of the 1st KIPS Spring Conf., vol. 1(1) (1994)
Kim, Y.I., Park, Y., Chun, J.: A dynamic indexing structure for searching time-series patterns. In: Proceedings of 20th International Computer Software and Applications Conference, August 21-23, pp. 270–275 (1996)
Keogh, E.J., Pazzani, M.J.: An indexing scheme for fast similarity search in large time series databases. In: Proceedings of the 11th International Conference on Scientific and Statistical Database Management, July 28-30, pp. 28–30 (1999)
Bozkaya, T., Ozsoyoglu, M.: Indexing large metric spaces for similarity search queries. ACM Transactions on Database Systems 24(3), 361–404 (1999)
Park, S., Kim, S., Chu, W.W.: Segment-based approach for subsequence searches in sequence databases. In: Proceedings of the 2001 ACM symposium on Applied computing, pp. 248–252 (2001)
Li, C.S., Yu, P.S., Castelli, V.: A Framework For Mining Sequence Database at Multiple Abstraction Levels. In: Proceedings of the 1998 ACM 7th international conference on Information and knowledge management, pp. 267–272 (1998)
Shasha, D., Wang, T.L.: New techniques for best-match retrieval. ACM Transactions on Information Systems 8(2), 140–158 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, ZY., Xue, YS., Lv, XH. (2004). A New Dynamic Indexing Structure for Searching Time-Series Patterns. In: Wang, S., et al. Conceptual Modeling for Advanced Application Domains. ER 2004. Lecture Notes in Computer Science, vol 3289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30466-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-30466-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23722-8
Online ISBN: 978-3-540-30466-1
eBook Packages: Springer Book Archive