Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Log
Event logs are used for a plethora of process analytics and mining techniques. A class of these mining activities is conformance (compliance) checking. The goal is to identify the violation of such patterns, i.e., anti-patterns. Several approaches have been proposed to tackle this analysis task. The...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://bspace.buid.ac.ae/handle/1234/2933 https://link.springer.com/chapter/10.1007/978-3-031-21595-7_11 https://doi.org/10.1007/978-3-031-21595-7_11 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1862980617316073472 |
|---|---|
| author | M. Zaki, Nesma |
| author2 | M. A. Helal, Iman E. Hassanein, Ehab Awad, Ahmed |
| author2_role | author author author |
| author_facet | M. Zaki, Nesma M. A. Helal, Iman E. Hassanein, Ehab Awad, Ahmed |
| author_role | author |
| dc.creator.none.fl_str_mv | M. Zaki, Nesma M. A. Helal, Iman E. Hassanein, Ehab Awad, Ahmed |
| dc.date.none.fl_str_mv | 2022 2025-05-06T09:48:49Z 2025-05-06T09:48:49Z |
| dc.identifier.none.fl_str_mv | Zaki, N.M., Helal, I.M.A., Hassanein, E.E., Awad, A. (2023). Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Logs. In: Fournier-Viger, P., Hassan, A., Bellatreche, L. (eds) Model and Data Engineering. MEDI 2022. Lecture Notes in Computer Science, vol 13761. Springer, Cham. https://bspace.buid.ac.ae/handle/1234/2933 https://link.springer.com/chapter/10.1007/978-3-031-21595-7_11 https://doi.org/10.1007/978-3-031-21595-7_11 |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | Springer, Cham |
| dc.relation.none.fl_str_mv | Model and Data Engineering |
| dc.subject.none.fl_str_mv | Anti pattern detection · Process mining · Graph-encoded event logs |
| dc.title.none.fl_str_mv | Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Log |
| dc.type.none.fl_str_mv | Article |
| description | Event logs are used for a plethora of process analytics and mining techniques. A class of these mining activities is conformance (compliance) checking. The goal is to identify the violation of such patterns, i.e., anti-patterns. Several approaches have been proposed to tackle this analysis task. These approaches have been based on differ ent data models and storage technologies of the event log including rela tional databases, graph databases, and proprietary formats. Graph-based encoding of event logs is a promising direction that turns several process analytic tasks into queries on the underlying graph. Compliance checking is one class of such analysis tasks. In this paper, we argue that encoding log data as graphs alone is not enough to guarantee efficient processing of queries on this data. Effi ciency is important due to the interactive nature of compliance checking. Thus, anti-pattern detection would benefit from sub-linear scanning of the data. Moreover, as more data are added, e.g., new batches of logs arrive, the data size should grow sub-linearly to optimize both the space of storage and time for querying. We propose two encoding methods using graph representations, realized in Neo4J & SQL Graph Database, and show the benefits of these encoding on a special class of queries, namely timed ordered anti-patterns. Compared to several baseline encoding, our experiments show up to 5x speed up in the querying time as well as a 3x reduction in the graph size. |
| id | budr_f82696b2d87d66326b646ece3bf31765 |
| identifier_str_mv | Zaki, N.M., Helal, I.M.A., Hassanein, E.E., Awad, A. (2023). Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Logs. In: Fournier-Viger, P., Hassan, A., Bellatreche, L. (eds) Model and Data Engineering. MEDI 2022. Lecture Notes in Computer Science, vol 13761. Springer, Cham. |
| language_invalid_str_mv | en |
| network_acronym_str | budr |
| network_name_str | The British University in Dubai repository |
| oai_identifier_str | oai:bspace.buid.ac.ae:1234/2933 |
| publishDate | 2022 |
| publisher.none.fl_str_mv | Springer, Cham |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event LogM. Zaki, NesmaM. A. Helal, ImanE. Hassanein, EhabAwad, AhmedAnti pattern detection · Process mining · Graph-encoded event logsEvent logs are used for a plethora of process analytics and mining techniques. A class of these mining activities is conformance (compliance) checking. The goal is to identify the violation of such patterns, i.e., anti-patterns. Several approaches have been proposed to tackle this analysis task. These approaches have been based on differ ent data models and storage technologies of the event log including rela tional databases, graph databases, and proprietary formats. Graph-based encoding of event logs is a promising direction that turns several process analytic tasks into queries on the underlying graph. Compliance checking is one class of such analysis tasks. In this paper, we argue that encoding log data as graphs alone is not enough to guarantee efficient processing of queries on this data. Effi ciency is important due to the interactive nature of compliance checking. Thus, anti-pattern detection would benefit from sub-linear scanning of the data. Moreover, as more data are added, e.g., new batches of logs arrive, the data size should grow sub-linearly to optimize both the space of storage and time for querying. We propose two encoding methods using graph representations, realized in Neo4J & SQL Graph Database, and show the benefits of these encoding on a special class of queries, namely timed ordered anti-patterns. Compared to several baseline encoding, our experiments show up to 5x speed up in the querying time as well as a 3x reduction in the graph size.Springer, Cham2025-05-06T09:48:49Z2025-05-06T09:48:49Z2022ArticleZaki, N.M., Helal, I.M.A., Hassanein, E.E., Awad, A. (2023). Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Logs. In: Fournier-Viger, P., Hassan, A., Bellatreche, L. (eds) Model and Data Engineering. MEDI 2022. Lecture Notes in Computer Science, vol 13761. Springer, Cham.https://bspace.buid.ac.ae/handle/1234/2933https://link.springer.com/chapter/10.1007/978-3-031-21595-7_11https://doi.org/10.1007/978-3-031-21595-7_11enModel and Data Engineeringoai:bspace.buid.ac.ae:1234/29332025-08-13T07:38:21Z |
| spellingShingle | Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Log M. Zaki, Nesma Anti pattern detection · Process mining · Graph-encoded event logs |
| title | Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Log |
| title_full | Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Log |
| title_fullStr | Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Log |
| title_full_unstemmed | Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Log |
| title_short | Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Log |
| title_sort | Efficient Checking of Timed Ordered Anti-patterns over Graph-Encoded Event Log |
| topic | Anti pattern detection · Process mining · Graph-encoded event logs |
| url | https://bspace.buid.ac.ae/handle/1234/2933 https://link.springer.com/chapter/10.1007/978-3-031-21595-7_11 https://doi.org/10.1007/978-3-031-21595-7_11 |