Skip to main content

Mining Expressive Process Models by Clustering Workflow Traces

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3056))

Abstract

We propose a general framework for the process mining problem which encompasses the assumption of workflow schema with local constraints only, for it being applicable to more expressive specification languages, independently of the particular syntax adopted. In fact, we provide an effective technique for process mining based on the rather unexplored concept of clustering workflow executions, in which clusters of executions sharing the same structure and the same unexpected behavior (w.r.t. the local properties) are seen as a witness of the existence of global constraints.

An interesting framework for assessing the similarity between the original model and the discovered one is proposed, as well as some experimental results evidencing the validity of our approach.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Gunopulos, D., Leymann, F.: Mining process models from workflow logs. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol. 1377, pp. 469–483. Springer, Heidelberg (1998)

    Google Scholar 

  2. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. of SIGMOD 1993, pp. 207–216 (1993)

    Google Scholar 

  3. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of the 20th Int’l Conference on Very Large Databases, pp. 487–499 (1994)

    Google Scholar 

  4. Cook, J.E., Wolf, A.L.: Automating process discovery through event-data analysis. In: Proc. 17th Int. Conf. on Software Engineering (ICSE 1995), pp. 73–82 (1995)

    Google Scholar 

  5. Davulcu, H., Kifer, M., Ramakrishnan, C.R., Ramakrishnan, I.V.: Logic based modeling and analysis of workflows. In: Proc. of PODS 1998, pp. 25–33 (1998)

    Google Scholar 

  6. Greco, G., Guzzo, A., Manco, G., Saccà, D.: Mining Frequent Instances on Workflows. In: Proc. of PAKDD 2003, pp. 209–221 (2003)

    Google Scholar 

  7. Han, J., Pei, J., Yi, Y.: Mining frequent patterns without candidate generation. In: Proc. Int. ACM Conf. on Management of Data (SIGMOD 2000), pp. 1–12 (2000)

    Google Scholar 

  8. Kim, Y., Nick Street, W., Menczer, F.: Feature selection in unsupervised learning via evolutionary search. In: Proceedings of the KDD 2000, pp. 365–369 (2000)

    Google Scholar 

  9. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSSR 163(4), 845–848 (1965)

    MathSciNet  Google Scholar 

  10. Lesh, N., Zaki, M.J., Ogihara, M.: Mining features for sequence classification. In: Proc. of KDD 1999, pp. 342–346 (1999)

    Google Scholar 

  11. Motoda, H., Liu, H.: Data reduction: feature selection. pp. 208–213 (2002)

    Google Scholar 

  12. Muth, P., Weifenfels, J., Gillmann, M., Weikum, G.: Integrating light-weight workflow management systems within existing business environments. In: Proc. 15th IEEE Int. Conf. on Data Engineering (ICDE 1999), pp. 286–293 (1999)

    Google Scholar 

  13. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Prefixspan: Mining sequential patterns by prefix-projected growth. In: Proc. of ICDE 2001, pp. 215–224 (2001)

    Google Scholar 

  14. Padmanabhan, B., Tuzhilin, A.: Small is beautiful: discovering the minimal set of unexpected patterns. In: Proc. of the 6th ACM SIGKDD, pp. 54–63 (2000)

    Google Scholar 

  15. van der Aalst, W.M.P.: The application of petri nets to worflow management. Journal of Circuits, Systems, and Computers 8(1), 21–66 (1998)

    Article  Google Scholar 

  16. van der Aalst, W.M.P., Hirnschall, A., Verbeek, H.M.W.: An alternative way to analyze workflow graphs. In: Proc. 14th Int. Conf. on Advanced Information Systems Engineering, pp. 534–552 (2002)

    Google Scholar 

  17. van der Aalst, W.M.P., van Hee, K.M.: Workflow Management: Models, Methods, and Systems. MIT Press, Cambridge (2002)

    Google Scholar 

  18. van der Aalst, W.M.P., van Dongen, B.F., Herbst, J., Maruster, L., Schimm, G., Weijters, A.J.M.M.: Workflow mining: A survey of issues and approaches. Data and Knowledge Engineering 47(2), 237–267 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greco, G., Guzzo, A., Pontieri, L., Saccà, D. (2004). Mining Expressive Process Models by Clustering Workflow Traces. In: Dai, H., Srikant, R., Zhang, C. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2004. Lecture Notes in Computer Science(), vol 3056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24775-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24775-3_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22064-0

  • Online ISBN: 978-3-540-24775-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics