Skip to main content

A Classification Algorithm for Process Sequences Based on Markov Chains and Bayesian Networks

  • Conference paper
Knowledge-Based and Intelligent Information and Engineering Systems (KES 2010)

Abstract

Companies in the customer-centric service sector deal with thousands of business processes on a daily basis. As different tasks progress along the process sequence, the process owners are interested in three key questions: which task could be the next in the remaining process path, how and when will the process finish? In this paper, we focus mainly on the first two question, the prediction of the length of the process path is part of further research. We propose a classification method based on Markov chains and Bayesian networks for predicting such properties like the remaining process flow, especially the next task in the process path, and the class of the process. This approach is applied and tested on real-world data, showing some interesting results and hints for further research.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, Berlin (2007)

    Google Scholar 

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

    Google Scholar 

  3. Van der Aalst, W., van Dongen, B., Herbst, J.: Workflow mining: a survey of issues and approaches. SData and Knowledge Engineering 2(47), 237–267 (2003)

    Google Scholar 

  4. Bonifati, A., Casati, F., Dayal, U., Shan, M.: Warehousing workflow data: Challenges and opportunities. In: Procs. of VLDB 2001, Rome, Italy (September 2001)

    Google Scholar 

  5. Panagos, E., Rabinovich, M.: Escalations in workflow management systems. In: Procs. of DART 1997, Rockville, Maryland (November 1997)

    Google Scholar 

  6. Norris, J.: Markov Chains (Cambridge Series in Statistical and Probabilistic Mathematics). Cambridge University Press, Cambridge (1998)

    Google Scholar 

  7. Lawler, G.F.: Introduction to Stochastic Processes. Crc Pr Inc., Boca Raton (2006)

    MATH  Google Scholar 

  8. Jensen, F.V., Nielsen, T.: Bayesian Networks and Decision Graphs. Springer, Berlin (2007)

    Book  MATH  Google Scholar 

  9. Tajima, F., Nei, M.: Estimation of evolutionary distance between nucleotide sequences. Molecular Biology and Evolution 1, 269–285 (1984)

    Google Scholar 

  10. Miller, W., Myers, E.W.: Sequence comparison with concave weighting functions. Bulletin of Mathematical Biology 50(2), 97–120 (1988)

    MATH  MathSciNet  Google Scholar 

  11. Gotoh, O.: An improved algorithm for matching biological sequences. Journal of Molecular Biology 162, 705–708 (1982)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tschumitschew, K., Nauck, D., Klawonn, F. (2010). A Classification Algorithm for Process Sequences Based on Markov Chains and Bayesian Networks. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science(), vol 6276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15387-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15387-7_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15386-0

  • Online ISBN: 978-3-642-15387-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics