Abstract
Workflow mining algorithms are used to improve and/or refine design of existing workflows. Workflows are composed of sequential, parallel, conflict and iterative structures. In this paper we present results of experimental complexity study of the alpha workflow mining algorithm. We studied time and space complexity as dependent on workflow’s internal structure and on the number of workflow tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cook J.E., Wolf A.L. (1998) Discovering Models of Software Processes from Event-Based Data. ACM Trans. on Software Engineering and Methodology, 7(3), 215–249, Springer, Berlin Heidelberg.
van der Aalst W.M.P., Weijters A.J.M.N., Maruster L. (2002) Workflow Mining: Which Processes can be Rediscovered? WP 74, Eindhoven University of Technology.
van der Aalst W.M.P., Weijters A.J.M.M., Maruster L, (2004) Workflow Mining: Discovering Process Models from Event Logs. IEEE Trans. on Knowledge and Data Engineering.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mikolajczak, B., Chen, JL. (2005). Workflow Mining Alpha Algorithm — A Complexity Study. In: Kłopotek, M.A., Wierzchoń, S.T., Trojanowski, K. (eds) Intelligent Information Processing and Web Mining. Advances in Soft Computing, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32392-9_51
Download citation
DOI: https://doi.org/10.1007/3-540-32392-9_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25056-2
Online ISBN: 978-3-540-32392-1
eBook Packages: EngineeringEngineering (R0)