Abstract
Predicting future events has great importance in many applications. Generally, rules with predicate events and consequent events are mined out, and then current events are matched with the predicate ones to predict the occurrence of consequent events. Many previous works focus on the rule mining problem; however, little emphasis has been attached to the problem of predicate events matching. As events often arrive in a stream, how to design an efficient and effective event predictor becomes challenging. In this paper, we give a clear definition of this problem and propose our own method. We develop an event filter and incrementally maintain parts of the matching results. By running a series of experiments, we show that our method is efficient and effective in the stream environment.
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.
Similar content being viewed by others
References
Cho, C.W., Zheng, Y., Chen, A.L.P.: Continuously Matching Episode Rules for Predicting Future Events over Event Streams. Tech. Report CS-1006-05, Department of Computer Science, National Tsing Hua University (October 2006)
Chomicki, J.: History-less Checking of Dynamic Integrity Constraints. In: Proceedings of the 8th International Conference on Data Engineering, pp. 557–564 (1992)
Giugno, R., Shasha, D.: GraphGrep: A Fast and Universal Method for Querying Graphs. In: 16th International Conference on Pattern Recognition, pp. 112–115 (2002)
He, H., Singh, A.K.: Closure-Tree: An Index Structure for Graph Queries. In: Proceedings of the 22nd International Conference on Data Engineering, p. 38 (2006)
Hsieh, C.E., Wu, Y.H., Chen, A.L.P.: Discovering Frequent Tree Patterns over Data Streams. In: Proceedings of the 6th SIAM International Conference on Data Mining (2006)
Mannila, H., Toivonen, H., Verkamo, A.I.: Discovering Frequent Episodes in Sequences. In: Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining, pp. 210–215 (1995)
Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of Frequent Episodes in Event Sequences. Data Mining and Knowledge Discovery 1(3), 259–289 (1997)
Olteanu, D., Kiesling, T., Bry, F.: An Evaluation of Regular Path Expressions with Qualifiers against XML Streams. In: Proceedings of the 19th International Conference on Data Engineering, pp. 702–704 (2003)
Peng, F., Chawathe, S.S.: XPath Queries on Streaming Data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 431–442 (2003)
Qin, M., Hwang, K.: Frequent Episode Rules for Internet Anomaly Detection. In: IEEE International Symposium on Network Computing and Applications, pp. 161–168 (2004)
Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, pp. 721–724 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Cho, CW., Zheng, Y., Chen, A.L.P. (2007). Continuously Matching Episode Rules for Predicting Future Events over Event Streams. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_91
Download citation
DOI: https://doi.org/10.1007/978-3-540-72524-4_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72483-4
Online ISBN: 978-3-540-72524-4
eBook Packages: Computer ScienceComputer Science (R0)