Alpha algorithm: Difference between revisions

Revision as of 16:37, 18 April 2010

Revision as of 07:26, 10 May 2010

Line 4:

<!--- move draft --->

<!--- not to be confused with alpha-beta or with alpha-shapes --->

The '''α-algorithm''' is an algorithm used in [[process mining]].

The '''α-algorithm''' is an algorithm used in [[process mining]], aimed at reconstructing causality from a set of sequences of events.

It was first put forward by [[Wil van der Aalst|van der Aalst]], Weijter and Măruşter <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.

Line 49 ⟶ 51:

* a [[petri net]] structure <math>\alpha(W) = (P_W,T_W,F_W)</math>

* with one input place <math>i_W</math> and one output place <math>o_W</math>

<!---* show:because whichevery istransition indeedof always a workflow net because there<math>T_W</math> is alwayson a <math>F_W</math>-path from <math>i_W</math> through every transition to <math>o_W</math>, --->it is indeed a workflow net.

<!--- consequence: short loops never occur. --->

Line 59 ⟶ 61:

== Limitations ==

WorkflowGeneral workflow nets may contain several types of constructs <ref>A. de Medeiros, A K and van der Aalst, W M P and Weijters, A J M M (2003). "Workflow Mining: Current Status and Future Directions". in: "volume 2888 of Lecture Notes in Computer Science", Springer-Verlag</ref> which the α-algorithm cannot rediscover.

{{section stub}}