Pi-CEP: Predictive Complex Event Processing Using Range Queries over Historical Pattern Space

Predictive Complex Event Processing (CEP) constitutes the next phase of CEP evolution and provides future predictive states of the partially matched complex sequences. In this paper, we demonstrate our novel predictive CEP system and show that this problem can be solved while leveraging existing data modelling, query execution and optimisation frameworks. We model the predictive detection of events over an N-dimensional historical matched sequence space. Hence, a predictive set of events can be determined by answering the range queries over the historical sequence space. In order to take advantage of range search over 1-dimensional data structures, we transform the N-dimensional space into 1-dimension using space filling z-order curve. We propose a compressed index structure to store 1- dimensional data and execute customised range query techniques. Furthermore, we propose an approximate summarisation technique, over the historical space of top-k most infrequent range queries, to cater catastrophic forgetting of older matches. Two real-world datasets are used to demonstrate the feasibility of our proposed techniques. We demonstrate that our system can efficiently predict complex events and it equips a user-friendly interface to fulfil the requirements of user-computer interaction in a real-time.

[1]  Lóránt Farkas,et al.  Predictive complex event processing: a conceptual framework for combining complex event processing and predictive analytics , 2012, BCI '12.

[2]  Owen Kaser,et al.  Better bitmap performance with Roaring bitmaps , 2014, Softw. Pract. Exp..

[3]  D. Hilbert Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[4]  Vincent S. Tseng,et al.  CPT+: Decreasing the Time/Space Complexity of the Compact Prediction Tree , 2015, PAKDD.

[5]  Ran El-Yaniv,et al.  On Prediction Using Variable Order Markov Models , 2004, J. Artif. Intell. Res..

[6]  Opher Etzion,et al.  Towards proactive event-driven computing , 2011, DEBS '11.

[7]  Peter Pirolli,et al.  Mining Longest Repeating Subsequences to Predict World Wide Web Surfing , 1999, USENIX Symposium on Internet Technologies and Systems.

[8]  Volker Markl,et al.  Integrating the UB-Tree into a Database System Kernel , 2000, VLDB.

[9]  Eli Upfal,et al.  Database-support for continuous prediction queries over streaming data , 2010, Proc. VLDB Endow..

[10]  Yanlei Diao,et al.  High-performance complex event processing over streams , 2006, SIGMOD Conference.

[11]  Graham Cormode,et al.  Sketch Techniques for Approximate Query Processing , 2010 .

[12]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[13]  Ameet Talwalkar,et al.  Foundations of Machine Learning , 2012, Adaptive computation and machine learning.

[14]  Didier Stricker,et al.  Creating and benchmarking a new dataset for physical activity monitoring , 2012, PETRA '12.

[15]  Ian H. Witten,et al.  Data Compression Using Adaptive Coding and Partial String Matching , 1984, IEEE Trans. Commun..

[16]  Alexander Artikis,et al.  A Prototype for Credit Card Fraud Management: Industry Paper , 2017, DEBS.