Advertisement

Fail Detection in WfM/BPM Systems from Event Log Sequences Using HMM-Type Models

  • Johnnatan JaramilloEmail author
  • Julián D. Arias-LondoñoEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1096)

Abstract

Currently, there is an increasing interest in predicting the behavior of active work items in Business Process Management (BPM) systems, which would make possible to monitor the behavior of such processes in a more accurate way. Given the complexity of current business processes, conventional techniques are not always effective in addressing this type of requirements; therefore, machine learning techniques are being increasingly more used for this task. This work deals with the problem of fail detection in a BPM system from event logs, based on machine learning methods. The paper explores the use of three structural learning models, Hidden Markov Models (HMM), Hidden semi-Markov models (HSMM) and Non-stationary Hidden semi-Markov models (NHSMM). The experiments are carried out using a real database of about 460,000 event logs sequences. The results show that for the given dataset, fail detection can be achieved with an accuracy of 86.70% using the HSMM model. In order to reduce the computational load of the proposed approach, the models were implemented in a distributed processing environment using Apache Spark, which guarantees solution scalability.

Keywords

Process mining Hidden Markov Models Hidden semi-Markov models Non-stationary semi-Markov models Apache Spark Distributed system 

References

  1. 1.
    Van der Aalst, W.M.P., et al.: Business process mining: an industrial application. Inf. Syst. 32(5), 713–732 (2007)CrossRefGoogle Scholar
  2. 2.
    Aalst, W.M.P.: Business process management demystified: a tutorial on models, systems and standards for workflow management. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 1–65. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-27755-2_1CrossRefGoogle Scholar
  3. 3.
    Agrawal, R., Gunopulos, D., Leymann, F.: Mining process models from workflow logs. In: Schek, H.-J., Alonso, G., Saltor, F., Ramos, I. (eds.) EDBT 1998. LNCS, vol. 1377, pp. 467–483. Springer, Heidelberg (1998).  https://doi.org/10.1007/BFb0101003CrossRefGoogle Scholar
  4. 4.
    Da Silva, G.A., Ferreira, D.R.: Applying hidden Markov models to process mining. In: Actas da 4a Conferencia Iberica de Sistemas e Tecnologias de Informacao, CISTI 2009, pp. 207–210. Associacao Iberica de Sistemas e Tecnologias de Informacao (2009)Google Scholar
  5. 5.
    Ferreira, D., Zacarias, M., Malheiros, M., Ferreira, P.: Approaching process mining with sequence clustering: experiments and findings. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 360–374. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-75183-0_26CrossRefGoogle Scholar
  6. 6.
    Fink, G.A.: Markov Models for Pattern Recognition, vol. 1, 2nd edn. Springer, London (2014).  https://doi.org/10.1007/978-1-4471-6308-4CrossRefzbMATHGoogle Scholar
  7. 7.
    Ge, X., Smyth, P.: Deformable Markov model templates for time-series pattern matching. In: Proceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 81–90 (2000)Google Scholar
  8. 8.
    Johnson, M.: Capacity and complexity of HMM duration modeling techniques. IEEE Sig. Process. Lett. 12(5), 407–410 (2005)CrossRefGoogle Scholar
  9. 9.
    Kang, Y.: Probabilistic process monitoring in process-aware information systems. Ph.D. thesis, University of Pittsburgh (2014)Google Scholar
  10. 10.
    van Lint, J.H.: Introduction to Coding Theory, Graduate Texts in Mathematics, vol. 86. Springer, Heidelberg (1999).  https://doi.org/10.1007/978-3-642-58575-3CrossRefGoogle Scholar
  11. 11.
    Marhasev, E., Hadad, M., Kaminka, G.A.: Non-stationary hidden semi Markov models in activity recognition. Signal Processing -1 (Rabiner 1989) (2006)Google Scholar
  12. 12.
    Rozinat, A., Veloso, M., Van der Aalst, W.: Using hidden Markov models to evaluate the quality of discovered process models. Extended version, pp. 1–53. BPM Center Report BPM-08-10, BPMcenter.org (2008)Google Scholar
  13. 13.
    Yu, S.-Z., Kobayashi, H.: An efficient forward-backward algorithm for an explicit-duration hidden Markov model. IEEE Sig. Process. Lett. 10(1), 11–14 (2003)CrossRefGoogle Scholar
  14. 14.
    Van der Aalst, W.M.P., Schonenberg, M.H., Song, M.: Time prediction based on process mining. Inf. Syst. 36(2), 450–475 (2011)CrossRefGoogle Scholar
  15. 15.
    Yu, S.Z.: Hidden semi-Markov models. Artif. Intell. 174(2), 215–243 (2010)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Yu, S.Z.: Hidden Semi-Markov Models Theory, Algorithms and Applications. Elsevier, Amsterdam (2016)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Intelligent Information Systems LabUniversidad de AntioquiaMedellínColombia
  2. 2.Department of Systems EngineeringUniversidad de AntioquiaMedellínColombia

Personalised recommendations