How to Prevent Fake Cycles in DFG Models Discovered from Event Logs?

Process mining methods are aimed at modelling and analysing process data generated by information systems. The processes often contain nonrecurring events that occur no more than once per case. Thus, a process model should not contain cycles with such events. If a cycle contains a nonrecurring event...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Programming and computer software Ročník 51; číslo 6; s. 395 - 408
Hlavní autori: Shaimov, N. D., Lomazova, I. A., Nesterov, R. A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Moscow Pleiades Publishing 01.12.2025
Springer Nature B.V
Predmet:
ISSN:0361-7688, 1608-3261
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Process mining methods are aimed at modelling and analysing process data generated by information systems. The processes often contain nonrecurring events that occur no more than once per case. Thus, a process model should not contain cycles with such events. If a cycle contains a nonrecurring event, we refer to it as a fake cycle. Existing process discovery algorithms produce process models with fake cycles that distort the observed behaviour of the process and reduce model precision. Fake cycles can be avoided by allowing multiple vertex instances for the same event in a process model, which breaks the cycles. In this paper, we propose a new algorithm to discover directly-follows graph process models without fake cycles. The algorithm partitions the event log into sublogs and merges the models discovered from these sublogs while preserving structural correctness. The effectiveness of the algorithm is tested on both real and synthetic event logs. The results demonstrate that the partition-merge approach produces models that preserve fitness while avoiding the introduction of fake cycles.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768825700264