LIPIcs.TIME.2023.17.pdf
- Filesize: 423 kB
- 3 pages
Document
Answer Set Automata: A Learnable Pattern Specification Framework for Complex Event Recognition (Extended Abstract)
Authors
Nikos Katzouris 
,
Georgios Paliouras
-
Part of:
Volume:
30th International Symposium on Temporal Representation and Reasoning (TIME 2023)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Temporal Representation and Reasoning (TIME) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-09-18
File
Document Identifiers
Author Details
- Institute of Informatics, National Center for Scientific Research "Demokritos", Athens, Greece
Cite AsGet BibTex
Nikos Katzouris and Georgios Paliouras. Answer Set Automata: A Learnable Pattern Specification Framework for Complex Event Recognition (Extended Abstract). In 30th International Symposium on Temporal Representation and Reasoning (TIME 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 278, pp. 17:1-17:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.TIME.2023.17
https://doi.org/10.4230/LIPIcs.TIME.2023.17
Abstract
Complex Event Recognition (CER) systems detect event occurrences in streaming input using predefined event patterns. Techniques that learn event patterns from data are highly desirable in CER. Since such patterns are typically represented by symbolic automata, we propose a family of such automata where the transition-enabling conditions are defined by Answer Set Programming (ASP) rules, and which, thanks to the strong connections of ASP to symbolic learning, are learnable from data. We present such a learning approach in ASP, capable of jointly learning the structure of an automaton and its transition guards' definitions from building-block predicates, and a scalable, incremental version thereof that progressively revises models learnt from mini-batches using Monte Carlo Tree Search. We evaluate our approach on three CER datasets and empirically demonstrate its efficacy.
Subject Classification
ACM Subject Classification
- Computing methodologies → Logic programming and answer set programming
Keywords
- Event Pattern Learning
- Answer Set Programming
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Loris D'Antoni and Margus Veanes. The power of symbolic automata and transducers. In International Conference on Computer Aided Verification, pages 47-67. Springer, 2017.
-
Lars George, Bruno Cadonna, and Matthias Weidlich. Il-miner: instance-level discovery of complex event patterns. Proceedings of the VLDB Endowment, 10(1):25-36, 2016.
-
Nikos Giatrakos, Elias Alevizos, Alexander Artikis, Antonios Deligiannakis, and Minos N. Garofalakis. Complex event recognition in the big data era: a survey. VLDB J., 29(1):313-352, 2020.
-
Alejandro Grez, Cristian Riveros, Martín Ugarte, and Stijn Vansummeren. A formal framework for complex event recognition. ACM Transactions on Database Systems (TODS), 46(4):1-49, 2021.
-
Sarah Kleest-Meißner, Rebecca Sattler, Markus L Schmid, Nicole Schweikardt, and Matthias Weidlich. Discovering multi-dimensional subsequence queries from traces-from theory to practice. BTW 2023, 2023.
-
Yan Li and Tingjian Ge. Imminence monitoring of critical events: A representation learning approach. In Proceedings of the 2021 International Conference on Management of Data, pages 1103-1115, 2021.
-
Alessandro Margara, Gianpaolo Cugola, and Giordano Tamburrelli. Learning from the past: automated rule generation for complex event processing. In Proceedings of the 8th ACM international conference on distributed event-based systems, pages 47-58, 2014.