Content deleted Content added
Citation bot (talk | contribs) Added bibcode. Removed URL that duplicated identifier. Removed parameters. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 109/1032 |
|||
| (7 intermediate revisions by 6 users not shown) | |||
Line 2:
It was first put forward by [[Wil van der Aalst|van der Aalst]], Weijters and Măruşter.<ref>van der Aalst, W M P and Weijters, A J M M and Maruster, L (2004). "Workflow Mining: Discovering process models from event logs", ''IEEE Transactions on Knowledge and Data Engineering'', vol 16</ref> The goal of Alpha miner is to convert the event log into a workflow-net based on the relations between various activities in the event log. An event log is a multi-set of traces, and a trace is a sequence of activity names. Several extensions or modifications of it have since been presented, which will be listed below.
Alpha miner was the first [[Business process discovery|process discovery]] algorithm ever proposed, and it gives a good overview of the aim of process discovery and how various activities within the process are executed. Alpha miner was also the basis for the development of many other process mining techniques such as [https://www.researchgate.net/publication/229124308_Process_Mining_with_the_Heuristics_Miner-algorithm heuristic miner], [https://www.researchgate.net/publication/220783863_Genetic_Process_Mining genetic mining] was developed based on the idea alpha miner is built on.<ref name=":02">{{Cite journal|
==Short description==
Line 72:
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 rules of alpha miner, activities belonging to various cases can have 4 types of relationships between them:<ref name=":02"/>
* '''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''', '''A > C.'''
* '''Causality: x → y''' iff x > y and not y > x. In our example, we can consider that '''A → E.'''
* '''Parallel: x || y''' iff x > y and y > x. In our example, we have '''B || C.'''
Line 78:
== Patterns ==
[[File:Sequence_pattern_for_petri_nets.png|alt=Sequence Pattern|349x349px]] '''Sequence Pattern: A → B'''
[[File:Xor-split_pattern_for_petri_nets.png|alt=XOR-split Pattern|321x321px]] '''XOR-split Pattern: A → B, A → C,''' and '''B # C''' [[File:And-split_pattern_for_petri_nets.png|alt=AND-split Pattern|321x321px]] '''AND-split Pattern: A → B, A → C,''' and '''B || C'''
Line 135 ⟶ 137:
The flow relation <math>F_W</math> is the union of the following:
* <math>\{(a,p_{(
* <math>\{(p_{(A,B)},b) | (A,B) \in Y_W \wedge b \in B\}</math>
* <math>\{(i_W,t) | t\in T_I\}</math>
Line 153 ⟶ 155:
==Limitations==
* '''Implicit places:''' Alpha miner cannot distinguish between implicit and required places and thus might result in additional non required places in the discovered petri net.<ref>{{Cite web|title=
* '''Loops:''' Alpha miner cannot discover loops of the length 1 and 2 in the process model.<ref name=":1">{{Cite web|title=Limitations of Alpha miner|url=https://courses.edsa-project.eu/pluginfile.php/281/mod_resource/content/0/17%20Alpha%20Algorithm%20-%20Limitations.pdf|url-status=live|archive-url=https://web.archive.org/web/20210831175934/https://courses.edsa-project.eu/pluginfile.php/281/mod_resource/content/0/17%20Alpha%20Algorithm%20-%20Limitations.pdf |archive-date=2021-08-31 }}</ref>
* Local dependencies are often missed in alpha miner.<ref name=":1" />
| |||