Abstract
Data mining can be used to extensively automate the data analysis process. Techniques for mining interval time series, however, have not been considered. Such time series are common in many applications. In this paper, we investigate mining techniques for such time series. Specifically, we propose a technique to discover temporal containment relationships. An item A is said to contain an item B if an event of type B occurs during the time span of an event of type A, and this is a frequent relationship in the data set. Mining such relationships allows the user to gain insight on the temporal relationships among various items. We implement the technique and analyze trace data collected from a real database application. Experimental results indicate that the proposed mining technique can discover interesting results. We also introduce a quantization technique as a preprocessing step to generalize the method to all time series.
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
Agrawal, R., Faloutsos, C. and Swami, A. Efficiency Similarity Search in Sequence Databases. Proceedings of the Conference of Foundations of Data Organization, 22. 1993.
Agrawal, R., Imielinski, T. and Swami, A. Mining Association Rules Between Sets of Items in Large Databases. ACM SIGMOD, 1993.
Agrawal, R., Psaila, G., Wimmers, E.L. and Zait, M. Querying Shapes of Histories. Proceedings of VLDB, 1995.
Agrawal, R. and Srikant, R. Mining Sequential Patterns. IEEE Data Engineering, 1995.
Bohlen, M.H., Busatto, R. and Jensen, C.S. Point-Versus Interval-based Temporal Data Models. IEEE Data Engineering, 1998.
Chakrabarti, S., Sarawagi, S. and Dom, B. Mining Surprising Patterns Using Temporal Description Length. Proceedings of the 24th VLDB Conference, 1998.
Das, G., Lin, K., Mannila, H., Renganathan, G. and Smyth, P. Rule Discovery From Time Series. The Fourth International Conference on Knowledge Discovery & Data Mining, 1998.
Morimoto, Y., Ishii, H. and Morishita, S. Efficient Construction of Regression Trees with Range and Region Splitting. Proceedings of the 23rd VLDB Conference, 1997.
Mannila, H., Toivonen, H. and Verkamo, A.I. Discovery of Frequent Episodes in Event Sequences. Data Mining and Knowledge Discovery 1, 259–289, 1997.
Rafiei, D. and Mendelzon, A. Similarity-Based Queries for Time Series Data. SIGMOD Record, 1997.
Ramaswamy, S., Mahajan, S. and Silberschatz, A. On the Discovery of Interesting Patterns in Association Rules. Proceedings of the 24th VLDB Conference, 1998.
Rastogi, R. and Shim, K. Mining Optimized Association Rules with Categorical and Numeric Attributes. IEEE Data Engineering, 1998.
Shatkay, H. and Zdonik, S.B. Approximate Queries and Representations for Large Data Sequences. Proceedings of the 12th International Conference on Data Engineering, 1996.
Yazdani, N. and Ozsoyoglu, Z.M. Sequence Matching of Images. Proceedings of the 8th International Conference on Scientific and Statistical Database Management, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Villafane, R., Hua, K.A., Tran, D., Maulik, B. (1999). Mining Interval Time Series. In: Mohania, M., Tjoa, A.M. (eds) DataWarehousing and Knowledge Discovery. DaWaK 1999. Lecture Notes in Computer Science, vol 1676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48298-9_34
Download citation
DOI: https://doi.org/10.1007/3-540-48298-9_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66458-1
Online ISBN: 978-3-540-48298-7
eBook Packages: Springer Book Archive