Abstract
Previous studies on frequent pattern discovery from temporal sequence mainly consider finding global patterns, where every record in a sequence contributes to support the patterns. In this paper, we present a novel problem class that is the discovery of local sequential patterns, which only a subsequence of the original sequence exhibits. The problem has a two-dimensional solution space consisting of patterns and temporal features, therefore it is impractical that use traditional methods on this problem directly in terms of either time complexity or result validity. Our approach is to maintain a suffix-tree-like index to support efficiently locating and counting of local patterns. Based on the index, a method is proposed for discovering such patterns. We have analyzed the behavior of the problem and evaluated the performance of our algorithm on both synthetic and real data. The results correspond with the definition of our problem and verify the superiority of our method.
The research has been supported in part of Chinese national key fundamental research program (No. G1998030414) and Chinese national fund of natural science (No. 79990580)
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
Wang, K., Tan., J., Incremental discovery of sequential patterns. ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, Montreal, Canada. 1996.
Mannila, H., Toivonen, H., Verkamo, A.I., Discovering frequent episodes in sequences. The First International Conference on Knowledge Discovery and Data Mining, Canada. 1995.
Kam, P.-s., Fu., A.W.-C., Discovering temporal patterns for interval-based events. DaWaK 2000, London, UK. 2000.
Chen, X., Petrounias, I., An integrated query and mining system for temporal association rules. DaWaK 2000, London, UK. 2000.
Tansel, A., Ayan, N., Discovery of association rules in temporal databases. KDD’98, Distributed Data Mining Workshop, New York, USA, 1998.
Han, J., Dong, G., Yin, Y., Efficient mining of partial periodic patterns in time series database. The Fifteenth International Conference on Data Engineering, Australia. 1999.
Srikant, R., Agrawal, R., Mining sequential patterns: generalizations and performance improvements. EDBT’96, Avignon, France, 1996.
Weiner, P., Linear pattern matching algorithms. Conference Record, The IEEE 14th Annual Symposium on Switching and Automata Theory, 1973.
Das, G., Lin, K., Mannila, H., Renganathan, G., Smyth, P., Rule discovery from time series. The 4th International Conference on Knowledge Discovery and Data Mining. 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jin, X., Wang, L., Lu, Y., Shi, C. (2002). Indexing and Mining of the Local Patterns in Sequence Database. In: Yin, H., Allinson, N., Freeman, R., Keane, J., Hubbard, S. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2002. IDEAL 2002. Lecture Notes in Computer Science, vol 2412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45675-9_12
Download citation
DOI: https://doi.org/10.1007/3-540-45675-9_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44025-3
Online ISBN: 978-3-540-45675-9
eBook Packages: Springer Book Archive