Alpha algorithm: Difference between revisions

Revision as of 10:23, 2 September 2021

Revision as of 10:34, 2 September 2021

Line 72:

<math>L1 = [<A,B,C,D>, <A,C,B,D>, <A,E,D>]</math>

Every event log can be boiled down into a multi-set of traces, and such traces can be further used to break down relationships between various activities in the process. According to the the rules of alpha miner, activities belonging to various cases can have 4 types of relationships between them <ref name=":02">{{Cite journal|last=van der Aalst|first=W.|last2=Weijters|first2=T.|last3=Maruster|first3=L.|date=2004-09|title=Workflow mining: discovering process models from event logs|url=https://ieeexplore.ieee.org/abstract/document/1316839?casa_token=9yHSQACaiPIAAAAA:9q5femdrrRk2ny9aWWLp4H2JRzLm5LcXzlsLZQztTS_0sG_w0pW2y41J1C-tReiZ_uiZdXSKMQ|journal=IEEE Transactions on Knowledge and Data Engineering|volume=16|issue=9|pages=1128–1142|doi=10.1109/TKDE.2004.47|issn=1558-2191}}</ref>:

* '''Direct Succession: x > y''' if and only if some relation x is directly following by y. In our example, we can consider that '''A > B''', '''A > E.'''