Abstract
Detecting occurrences of complex events in an event stream requires designing queries that describe real-world situations. However, specifying complex event patterns is a challenging task that requires domain and system specific knowledge. Novel approaches are required that automatically identify patterns of potential interest in a heavy flow of events.
We present and evaluate a probability-based approach for discovering frequent and infrequent sequences of events in an event stream. The approach was tested on a real-world dataset as well as on synthetically generated data with the task being the identification of the most frequent event patterns of a given length. The results were evaluated by measuring the values of Recall and Precision. Our experiments show that the approach can be applied to efficiently retrieve patterns based on their estimated frequencies.
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
Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the Eleventh International Conference on Data Engineering, ICDE 1995, pp. 3–14. IEEE Computer Society, Washington, DC, USA (1995). http://dl.acm.org/citation.cfm?id=645480.655281
Chakravarthy, S., Krishnaprasad, V., Anwar, E., Kim, S.K.: Composite events for active databases: semantics, contexts and detection. In: VLDB 1994. pp. 606–617. Morgan Kaufmann Publishers Inc., San Francisco (1994). http://dl.acm.org/citation.cfm?id=645920.672994
Chang, J.H., Lee, W.S.: Finding recent frequent itemsets adaptively over online data streams. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 487–492. ACM, New York (2003). http://doi.acm.org/10.1145/956750.956807
Chen, L., Mei, Q.: Mining frequent items in data stream using time fading model. Information Sciences 257, 54–69 (2014). http://www.sciencedirect.com/science/article/pii/S0020025513006403
Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Moment: maintaining closed frequent itemsets over a stream sliding window. In: In ICDM, pp. 59–66 (2004)
Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.: Mining frequent patterns in data streams at multiple time granularities. Next Generation Data Mining 212, 191–212 (2003)
Gomariz, A., Campos, M., Marin, R., Goethals, B.: ClaSP: an efficient algorithm for mining frequent closed sequences. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS, vol. 7818, pp. 50–61. Springer, Heidelberg (2013)
Luckham, D., Schulte, W.R.: Event processing glossary – version 2.0 (2011)
Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of VLDB 2002, pp. 346–357 (2002)
Margara, A., Cugola, G., Tamburrelli, G.: Learning from the past: automated rule generation for complex event processing. In: Proceedings of the 8th ACM International Conference on Distributed Event-Based Systems, DEBS 2014, pp. 47–58. ACM, New York (2014). http://doi.acm.org/10.1145/2611286.2611289
Mitsa, T.: Temporal Data Mining, 1st edn. Chapman & Hall/CRC (2010)
Pei, J., Han, J., Mortazavi-asl, B., Pinto, H., Chen, Q., Dayal, U., chun Hsu, M.: Prefixspan: mining sequential patterns efficiently by prefix-projected pattern growth. In: ICDE 2001, p. 215. IEEE Computer Society, Washington, DC (2001). http://dl.acm.org/citation.cfm?id=876881.879716
Rijsbergen, C.J.V.: Information Retrieval, 2nd edn. Butterworth-Heinemann, Newton (1979)
Yan, X., Han, J., Afshar, R.: Clospan: mining closed sequential patterns in large datasets. In. In SDM, pp. 166–177 (2003)
Yu, J.X., Chong, Z., Lu, H., Zhou, A.: False positive or false negative: mining frequent itemsets from high speed transactional data streams. In: VLDB 2004, pp. 204–215. VLDB Endowment (2004). http://dl.acm.org/citation.cfm?id=1316689.1316709
Zaki, M.J.: Spade: An efficient algorithm for mining frequent sequences. Mach. Learn. 42(1–2), 31–60 (2001). http://dx.doi.org/10.1023/A:1007652502315
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Hasan, A., Teymourian, K., Paschke, A. (2015). Probabilistic Event Pattern Discovery. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds) Rule Technologies: Foundations, Tools, and Applications. RuleML 2015. Lecture Notes in Computer Science(), vol 9202. Springer, Cham. https://doi.org/10.1007/978-3-319-21542-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-21542-6_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21541-9
Online ISBN: 978-3-319-21542-6
eBook Packages: Computer ScienceComputer Science (R0)