Skip to main content

A Tool for Computing Probabilistic Trace Alignments

  • Conference paper
  • First Online:
Book cover Intelligent Information Systems (CAiSE 2021)

Abstract

Alignments pinpoint trace deviations in a process model and quantify their severity. However, approaches based on trace alignments use crisp process models and recent probabilistic conformance checking approaches check the degree of conformance of an event log with respect to a stochastic process model instead of finding trace alignments. In this paper, for the first time, we provide a conformance checking approach based on trace alignments using stochastic Workflow nets. Conceptually, this requires to handle the two possibly contrasting forces of the cost of the alignment on the one hand and the likelihood of the model trace with respect to which the alignment is computed on the other.

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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.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

Notes

  1. 1.

    https://github.com/jackbergus/approxProbTraceAlign.

References

  1. Adriansyah, A., van Dongen, B.F., van der Aalst, W.M.P.: Conformance checking using cost-based fitness analysis. In: EDOC 2011, pp. 55–64. IEEE (2011)

    Google Scholar 

  2. Altman, N.S.: An introduction to kernel and nearest-neighbor nonparametric regression. Am. Stat. 46(3), 175–185 (1992)

    MathSciNet  Google Scholar 

  3. Bergami, G., Bertini, F., Montesi, D.: Hierarchical embedding for DAG reachability queries. In: IDEAS, pp. 24:1–24:10. ACM (2020)

    Google Scholar 

  4. Driessens, K., Ramon, J., Gärtner, T.: Graph kernels and gaussian processes for relational reinforcement learning. Mach. Learn. 64(1–3), 91–119 (2006). https://doi.org/10.1007/s10994-006-8258-y

    Article  MATH  Google Scholar 

  5. Gärtner, T.: A survey of kernels for structured data. SIGKDD 5(1), 49–58 (2003)

    Article  Google Scholar 

  6. Gärtner, T., Flach, P., Wrobel, S.: On graph kernels: hardness results and efficient alternatives. In: Schölkopf, B., Warmuth, M.K. (eds.) COLT-Kernel 2003. LNCS (LNAI), vol. 2777, pp. 129–143. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45167-9_11

    Chapter  MATH  Google Scholar 

  7. Leemans, S.J.J., Syring, A.F., van der Aalst, W.M.P.: Earth movers’ stochastic conformance checking. In: Hildebrandt, T., van Dongen, B.F., Röglinger, M., Mendling, J. (eds.) BPM 2019. LNBIP, vol. 360, pp. 127–143. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-26643-1_8

    Chapter  Google Scholar 

  8. de Leoni, M., Marrella, A.: Aligning real process executions and prescriptive process models through automated planning. Expert Syst. Appl. 82, 162–183 (2017)

    Article  Google Scholar 

  9. Lodhi, H., Saunders, C., Shawe-Taylor, J., Cristianini, N., Watkins, C.J.C.H.: Text classification using string kernels. J. Mach. Learn. Res. 2, 419–444 (2002)

    MATH  Google Scholar 

  10. Polyvyanyy, A., Kalenkova, A.A.: Monotone conformance checking for partially matching designed and observed processes. In: ICPM, pp. 81–88 (2019)

    Google Scholar 

  11. Polyvyanyy, A., Solti, A., Weidlich, M., Di Ciccio, C., Mendling, J.: Monotone precision and recall measures for comparing executions and specifications of dynamic systems. ACM Trans. Softw. Eng. Methodol. 29(3), 17:1–17:41 (2020)

    Google Scholar 

  12. Seshadhri, C., Sharma, A., Stolman, A., Goel, A.: The impossibility of low-rank representations for triangle-rich complex networks. Proc. Natl. Acad. Sci. 117(11), 5631–5637 (2020)

    Article  Google Scholar 

Download references

Acknowledgments

This research has been partially supported by the project IDEE (FESR1133) funded by the Eur. Reg. Development Fund (ERDF) Investment for Growth and Jobs Programme 2014–2020.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Giacomo Bergami .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bergami, G., Maggi, F.M., Montali, M., Peñaloza, R. (2021). A Tool for Computing Probabilistic Trace Alignments. In: Nurcan, S., Korthaus, A. (eds) Intelligent Information Systems. CAiSE 2021. Lecture Notes in Business Information Processing, vol 424. Springer, Cham. https://doi.org/10.1007/978-3-030-79108-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-79108-7_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-79107-0

  • Online ISBN: 978-3-030-79108-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics