Abstract
This paper studies sample applications of skeletal algorithm to process mining and automata discovery. The basic idea behind the skeletal algorithm is to express a problem in terms of congruences on a structure, build an initial set of congruences, and improve it by taking limited unions/intersections, until a suitable condition is reached. Skeletal algorithms naturally arise in the context of process minig and automata discovery, where the skeleton is the “free” structure on initial data and a congruence corresponds to similarities in data. In such a context, skeletal algorithms come equipped with fitness functions measuring the complexity of a model. We examine two fitness functions for our sample problem — one based on Minimum Description Length Principle, and the other based on Bayesian Interpretation.
This work has been partially supported by Polish National Science Center, project DEC-2011/01/N/ST6/02752.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 42 (1980)
Brazma, A.: Efficient Algorithm for Learning Simple Regular Expressions from Noisy Examples. In: Arikawa, S., Jantke, K.P. (eds.) AII 1994 and ALT 1994. LNCS, vol. 872, pp. 260–271. Springer, Heidelberg (1994)
Bremermann, H.J.: Optimization through evolution and recombination. In: Yovitts, M.C., et al. (eds.) Self-Organizing Systems 1962, pp. 93–106. Spartan Books, Washington (1962)
Cook, J., Woolf, A.: Discovering models of software processes from event-based data. ACM Transactions on Software Engineering and Methodology 7(3) (1998)
de Medeiros, A., van Dongen, B., van der Aalst, W., Weijters, A.: Process mining: Extending the alpha-algorithm to mine short loops. BETA Working Paper Series, Eindhoven University of Technology, Eindhoven (2004)
Friedberg, R.M.: A learning machines part i. IBM Journal of Research and Development 2 (1956)
Friedberg, R.M., Dunham, B., North, J.H.: A learning machines part ii. IBM Journal of Research and Development 3 (1959)
Gold, E.: Language identification in the limit. Information and Control 10 (1967)
Grunwald, P.D., Rissanen, J.: The minimum description length principle. In: Adaptive Computation and Machine Learning Series. The MIT Press (2007)
Herbst, J.: A Machine Learning Approach to Workflow Management. In: Lopez de Mantaras, R., Plaza, E. (eds.) ECML 2000. LNCS (LNAI), vol. 1810, pp. 183–194. Springer, Heidelberg (2000)
Holland, J.H.: Adaption in natural and artificial systems. The University of Michigan Press, Ann Arbor (1975)
Medeiros, A., Weijters, A., van der Aalst, W.: Genetic process mining: an experimental evaluation. Data Mining and Knowledge Discovery 14(2) (2007)
Przybylek, A.: The Integration of Functional Decomposition with UML Notation in Business Process Modelling. In: Advances in Information Systems Development, pp. 85–99. Springer (2008)
Przybylek, M.: Skeletal Algorithms. In: International Conference on Evolutionary Computation Theory and Applications 2011, pp. 80–89 (2011)
Rechenberg, I.: Evolutions strategie -— optimierung technischer systeme nach prinzipien der biologischen evolution. PhD thesis (1971), reprinted by Fromman-Holzboog (1973)
Ren, C., Wen, L., Dong, J., Ding, H., Wang, W., Qiu, M.: A novel approach for process mining based on event types. In: IEEE SCC 2007, pp. 721–722 (2007)
Valiant, L.: A theory of the learnable. Communications of the ACM 27 (1984)
van der Aalst, W.: Process mining: Discovery, conformance and enhancement of business processes. Springer (2011)
van der Aalst, W., de Medeiros, A.A., Weijters, A.: Process equivalence in the context of genetic mining. BPM Center Report BPM-06-15, BPMcenter.org (2006a)
van der Aalst, W., Pesic, M., M.S.: Beyond process mining: From the past to present and future. BPM Center Report BPM-09-18, BPMcenter.org (2009)
van der Aalst, W., ter Hofstede, A.: Workflow patterns: On the expressive power of (petri-net-based) workflow languages. BPM Center Report BPM-02-02, BPMcenter.org (2002)
van der Aalst, W., ter Hofstede, A., Kiepuszewski, B., Barros, A.: Workflow patterns. BPM Center Report BPM-00-02, BPMcenter.org (2000)
van der Aalst, W., van Dongen, B.F.: Discovering Workflow Performance Models from Timed Logs. In: Han, Y., Tai, S., Wikarski, D. (eds.) EDCIS 2002. LNCS, vol. 2480, pp. 45–63. Springer, Heidelberg (2002)
van der Aalst, W., Weijters, A., Maruster, L.: Workflow mining: Discovering process models from event logs. BPM Center Report BPM-04-06, BPMcenter.org (2006b)
Weijters, A., van der Aalst, W.: Process mining: Discovering workflow models from event-based data. In: Proceedings of the 13th Belgium-Netherlands Conference on Artificial Intelligence, pp. 283–290. Springer, Maastricht (2001)
Wen, L., Wang, J., Sun, J.: Detecting Implicit Dependencies Between Tasks from Event Logs. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds.) APWeb 2006. LNCS, vol. 3841, pp. 591–603. Springer, Heidelberg (2006)
Wynn, M., Edmond, D., van der Aalst, W., ter Hofstede, A.: Achieving a general, formal and decidable approach to the or-join in workflow using reset nets. BPM Center Report BPM-04-05, BPMcenter.org (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Przybylek, M.R. (2013). Skeletal Algorithms in Process Mining. In: Madani, K., Dourado, A., Rosa, A., Filipe, J. (eds) Computational Intelligence. IJCCI 2011. Studies in Computational Intelligence, vol 465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35638-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-35638-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35637-7
Online ISBN: 978-3-642-35638-4
eBook Packages: EngineeringEngineering (R0)