Nothing Special   »   [go: up one dir, main page]

Skip to main content

Abstractions in Process Mining: A Taxonomy of Patterns

  • Conference paper
Business Process Management (BPM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5701))

Included in the following conference series:

Abstract

Process mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms have problems dealing with such unstructured processes and generate spaghetti-like process models that are hard to comprehend. One reason for such a result can be attributed to constructing process models from raw traces without due pre-processing. In an event log, there can be instances where the system is subjected to similar execution patterns/behavior. Discovery of common patterns of invocation of activities in traces (beyond the immediate succession relation) can help in improving the discovery of process models and can assist in defining the conceptual relationship between the tasks/activities.

In this paper, we characterize and explore the manifestation of commonly used process model constructs in the event log and adopt pattern definitions that capture these manifestations, and propose a means to form abstractions over these patterns. We also propose an iterative method of transformation of traces which can be applied as a pre-processing step for most of today’s process mining techniques. The proposed approaches are shown to identify promising patterns and conceptually-valid abstractions on a real-life log. The patterns discussed in this paper have multiple applications such as trace clustering, fault diagnosis/anomaly detection besides being an enabler for hierarchical process discovery.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. van der Aalst, W., Weijters, A., Maruster, L.: Workflow Mining: Discovering Process Models from Event Logs. IEEE Trans. Knowl. Data Eng. 16(9), 1128–1142 (2004)

    Article  Google Scholar 

  2. de Medeiros, A.K.A., van der Aalst, W., Pedrinaci, C.: Semantic Process Mining Tools: Core Building Blocks. In: 16th European Conference on Information Systems, pp. 1953–1964 (2008)

    Google Scholar 

  3. Ristad, E.S., Yianilos, P.N.: Learning String-Edit Distance. IEEE Trans. PAMI 20(5), 522–532 (1998)

    Article  Google Scholar 

  4. Bose, R.P.J.C., van der Aalst, W.: Context Aware Trace Clustering: Towards Improving Process Mining Results. In: SIAM International Conference on Data Mining, pp. 401–412 (2009)

    Google Scholar 

  5. Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  6. Kolpakov, K.: Finding Maximal Repetitions in a Word in Linear Time. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 596–604 (1999)

    Google Scholar 

  7. Cheung, C.F., Yu, J.X., Lu, H.: Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory. IEEE Trans. Knowl. Data Eng. 17(1), 90–105 (2005)

    Article  Google Scholar 

  8. Gusfield, D., Stoye, J.: Linear Time Algorithms for Finding and Representing all the Tandem Repeats in a String. Journal of Computer and System Sciences 69, 525–546 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Sokol, D., Benson, G., Tojeira, J.: Tandem Repeats Over the Edit Distance. Bioinformatics 23(2), e30–e36 (2007)

    Article  Google Scholar 

  10. Ukkonen, E.: On-Line Construction of Suffix Trees. Algorithmica 14(3), 249–260 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Greco, G., Guzzo, A., Pontieri, L.: Mining Hierarchies of Models: From Abstract Views to Concrete Specifications. In: Business Process Management, pp. 32–47 (2005)

    Google Scholar 

  12. Greco, G., Guzzo, A., Pontieri, L.: Mining Taxonomies of Process Models. Data Knowl. Eng. 67(1), 74–102 (2008)

    Article  Google Scholar 

  13. Polyvyanyy, A., Smirnov, S., Weske, M.: Process Model Abstraction: A Slider Approach. In: Enterprise Distributed Object Computing, pp. 325–331 (2008)

    Google Scholar 

  14. Günther, C.W., van der Aalst, W.M.P.: Fuzzy Mining - Adaptive Process Simplification Based on Multi-perspective Metrics. In: Business Process Management, pp. 328–343 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jagadeesh Chandra Bose, R.P., van der Aalst, W.M.P. (2009). Abstractions in Process Mining: A Taxonomy of Patterns. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds) Business Process Management. BPM 2009. Lecture Notes in Computer Science, vol 5701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03848-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03848-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03847-1

  • Online ISBN: 978-3-642-03848-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics