Alpha algorithm: Difference between revisions

Revision as of 20:09, 10 July 2013

Revision as of 09:52, 20 August 2013

Line 1:

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

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

It was first put forward by [[Wil van der Aalst|van der Aalst]], WeijterWeijters and Măruşter.<ref>van der Aalst, W M P and WeijterWeijters, 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 net]]s) from event logs (as might be collected by an [[Enterprise resource planning|ERP]] system). Each transition in the net corresponds to an observed task.