Content deleted Content added
mNo edit summary |
No edit summary |
||
Line 4:
The '''α-algorithm''' is an algorithm used in [[process mining]].
It was first put forward by [[Wil van der Aalst|van der Aalst]], Weijter and Maruster <ref>van der Aalst, W M P and Weijter, A J M M and Maruster, L (2003). "Workflow Mining: Discovering process models from event logs", ''IEEE Transactions on Knowledge and Data Engineering'', vol 16</ref>. Several extensions or modifications of it have since been presented, which will be listed below.
It constructs [[petri nets|P/T nets]] with special properties ([[workflow nets]]) from event logs (as might be collected by an [[ERP]] system). Each transition in the net corresponds to an observed task.
Line 67:
{{section stub}}
for example <ref name="extending_the">A. de Medeiros, A K and van Dongen, B F and van der Aalst, W M P and Weijters, A (2004). "Process mining: extending the α-algorithm to mine short loops"</ref>
<ref name="wen2007mining">Wen, L and van der Aalst, W M P and Wang, J and Sun, J (2007). "Mining process models with non-free-choice constructs",
"Data Mining and Knowledge Discovery" vol 15, p. 145--180, Springer-Verlag</ref>
== References ==
|