Skip to main content

Directed Acyclic Graph Extraction from Event Logs

  • Conference paper
Information and Software Technologies (ICIST 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 465))

Included in the following conference series:

Abstract

The usage of probabilistic models in business process mining enables analysis of business processes in a more efficient manner. Although, the Bayesian belief network is one of the most common probabilistic models, possibilities to use it in business process mining are still not widely researched. Existing process mining approaches are incapable to extract directed acyclic graphs for representing Bayesian networks. This paper presents an approach for extraction of directed acyclic graph from event logs. The results obtained during the experiment show that the proposed approach is feasible and may be applied in practice.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aytulun, S.K., Guneri, A.F.: Business process modelling with stochastic networks. Int. J. Prod. Res. 46, 2743–2764 (2008)

    Article  MATH  Google Scholar 

  2. Rozinat, A., Mans, R.S., Song, M., van der Aalst, W.M.P.: Discovering simulation models. Inf. Syst. 34, 305–327 (2009)

    Article  Google Scholar 

  3. van Dongen, B.F., Crooy, R.A., van der Aalst, W.M.P.: Cycle time prediction: When will this case finally be finished? In: Meersman, R., Tari, Z. (eds.) OTM 2008, Part I. LNCS, vol. 5331, pp. 319–336. Springer, Heidelberg (2008)

    Google Scholar 

  4. van der Aalst, W.M.P., de Medeiros, A.K.A., Weijters, A.J.M.M.: Genetic process mining. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 48–69. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Van Dongen, B.F., van der Aalst, W.M.P.: A Meta Model for Process Mining Data. EMOI-INTEROP 160, 30 (2005)

    Google Scholar 

  6. Verbeek, H.M.W., Buijs, J.C.A.M., van Dongen, B.F., van der Aalst, W.M.P.: XES, xESame, and proM 6. In: Soffer, P., Proper, E. (eds.) CAiSE Forum 2010. LNBIP, vol. 72, pp. 60–75. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Van der Aalst, W.M.P., Rubin, V., Verbeek, H.M.W., van Dongen, B.F., Kindler, E., Günther, C.W.: Process mining: a two-step approach to balance between underfitting and overfitting. Softw. Syst. Model. 9, 87–111 (2010)

    Article  Google Scholar 

  8. Weijters, A.J.M.M., Van Der Aalst, W.M.P., Medeiros, A.K.A.: De: Process Mining with the HeuristicsMiner Algorithm. Cirp Ann. Technol. 166, 1–34 (2006)

    Google Scholar 

  9. van Dongen, B.F., Alves de Medeiros, A.K., Wen, L.: Process mining: Overview and outlook of petri net discovery algorithms. In: Jensen, K., van der Aalst, W.M.P. (eds.) ToPNoC II. LNCS, vol. 5460, pp. 225–242. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Mannila, H., Meek, C.: Global partial orders from sequential data. In: Proceedings of the sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 161–168 (2000)

    Google Scholar 

  11. van Dongen, B.F., Crooy, R.A., van der Aalst, W.M.P.: Cycle time prediction: When will this case finally be finished? In: Meersman, R., Tari, Z. (eds.) OTM 2008, Part I. LNCS, vol. 5331, pp. 319–336. Springer, Heidelberg (2008)

    Google Scholar 

  12. Van der Aalst, W.M.P., Schonenberg, M.H., Song, M.: Time prediction based on process mining. Inf. Syst. 36, 450–475 (2011)

    Article  Google Scholar 

  13. Liu, Y., Zhang, H., Li, C., Jiao, R.J.: Workflow simulation for operational decision support using event graph through process mining. Decis. Support Syst. 52, 685–697 (2012)

    Article  Google Scholar 

  14. Rozinat, A., Van Der Aalst, W.M.P.: Decision Mining in Business Processes

    Google Scholar 

  15. De Leoni, M., van der Aalst, W.M.P.: Data-aware process mining: discovering decisions in processes using alignments. In: Proceedings of the 28th Annual ACM Symposium on Applied Computing, pp. 1454–1461 (2013)

    Google Scholar 

  16. Sutrisnowati, R.A., Bae, H., Park, J., Ha, B.-H.: Learning Bayesian Network from Event Logs Using Mutual Information Test. In: 2013 IEEE 6th Int. Conf. Serv. Comput. Appl., pp. 356–360 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Vasilecas, O., Savickas, T., Lebedys, E. (2014). Directed Acyclic Graph Extraction from Event Logs. In: Dregvaite, G., Damasevicius, R. (eds) Information and Software Technologies. ICIST 2014. Communications in Computer and Information Science, vol 465. Springer, Cham. https://doi.org/10.1007/978-3-319-11958-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11958-8_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11957-1

  • Online ISBN: 978-3-319-11958-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics