Advertisement

Control-Flow Business Process Summarization via Activity Contraction

  • Valeria FiondaEmail author
  • Gianluigi Greco
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11872)

Abstract

Organizations collect and store considerable amounts of process data in event logs that are subsequently mined to obtain process models. When the business process involves hundreds of activities, executed according to complex execution patterns, the process model can become too large and complex to identify relevant information by manual and visual inspection only. Summarization techniques can help, by providing concise and meaningful representations of the underling process. This paper describes a business process summarization algorithm based on the hierarchical grouping of activities. In the proposed approach, activity grouping is guided by the existence of some relations, between pairs of activities, mined from the associated event log.

Keywords

Business process Summarization Process Mining 

References

  1. 1.
    Dunne, C., Shneiderman, B.: Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. In: Proceedings of CHI, pp. 3247–3256 (2013)Google Scholar
  2. 2.
    Kopp, O., Martin, D., Wutke, D., Leymann, F.: The difference between graph-based and block-structured business process modelling languages. EMISA 4(1), 3–13 (2009)Google Scholar
  3. 3.
    LeFevre, K., Terzi, E.: GraSS: graph structure summarization. In: Proceedings of SDM, pp. 454–465 (2010)Google Scholar
  4. 4.
    Liu, Y., Safavi, T., Dighe, A., Koutra, D.: Graph summarization methods and applications: a survey. ACM Comput. Surv. 51(3), 62 (2018)CrossRefGoogle Scholar
  5. 5.
    Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)CrossRefGoogle Scholar
  6. 6.
    Purohit, M., Prakash, B.A., Kang, C., Zhang, Y., Subrahmanian, V.S.: Fast influence-based coarsening for large networks. In: Proceedings of SIGKDD, pp. 1296–1305 (2014)Google Scholar
  7. 7.
    Raghavan, S., Garcia-Molina, H.: Representing web graphs. In: Proceedings of ICDE, pp. 405–416 (2003)Google Scholar
  8. 8.
    Riondato, M., García-Soriano, D., Bonchi, F.: Graph summarization with quality guarantees. Data Min. Knowl. Discov. 31(2), 314–349 (2017)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Song, Q., Wu, Y., Lin, P., Dong, L., Sun, H.: Mining summaries for knowledge graph search. IEEE Trans. Knowl. Data Eng. 30, 1887–1900 (2018)CrossRefGoogle Scholar
  10. 10.
    Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of weighted graphs. In: Proceedings of SIGKDD, pp. 965–973 (2011)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.DeMaCSUniversity of CalabriaRendeItaly

Personalised recommendations