Skip to main content

Discovering Infrequent Behavioral Patterns in Process Models

  • Conference paper
  • First Online:
Business Process Management (BPM 2017)

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

Included in the following conference series:

Abstract

Process mining has focused, among others, on the discovery of frequent behavior with the aim to understand what is mainly happening in a process. Little work has been done involving uncommon behavior, and mostly centered on the detection of anomalies or deviations. But infrequent behavior can be also important for the management of a process, as it can reveal, for instance, an uncommon wrong realization of a part of the process. In this paper, we present WoMine-i, a novel algorithm to retrieve infrequent behavioral patterns from a process model. Our approach searches in a process model extracting structures with sequences, selections, parallels and loops, which are infrequently executed in the logs. This proposal has been validated with a set of synthetic and real process models, and compared with state of the art techniques. Experiments show that WoMine-i can find all types of patterns, extracting information that cannot be mined with the state of the art techniques.

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

Access this chapter

Institutional subscriptions

Notes

  1. 1.

    \(\mathcal {P}(A) = \{A' \mid A' \subseteq A\}\) is the powerset of A. Hence, elements of AS are sets of sets of activities.

  2. 2.

    The successors of an activity \(\alpha \) are the activities with a path from \(\alpha \) to them, e.g., the successors of B in Fig. 2a are F, G, H and J.

  3. 3.

    The predecessors of an activity \(\alpha \) are the activities with a path from them to \(\alpha \), e.g., the predecessors of C in Fig. 2a are C, I and A.

  4. 4.

    An a priori search uses the previous —a priori— knowledge. It reduces the search space by pruning the exploration of the paths that will not finish in a valuable result.

  5. 5.

    A Petri net is 1-safe when there can be only one mark in a place at the same time.

  6. 6.

    The algorithm and datasets can be downloaded from http://tec.citius.usc.es/processmining/womine/.

  7. 7.

    BPIC 2012 - 10.4121/uuid:3926db30-f712-4394-aebc-75976070e91f. This dataset has been split into two logs: 2012_a contains the events related with the state of an application process, while 2012_o has the events related with the state of an offer belonging to an application process.

  8. 8.

    BPIC 2013 clo - 10.4121/uuid:c2c3b154-ab26-4b31-a0e8-8f2350ddac11.

  9. 9.

    BPIC 2013 op - 10.4121/uuid:3537c19d-6c64-4b1d-815d-915ab0e479da.

References

  1. Weijters, A., van Der Aalst, W.M., De Medeiros, A.A.: Process mining with the heuristics miner-algorithm. Technische Universiteit Eindhoven, Technical report WP 166 1–34 (2006)

    Google Scholar 

  2. Leemans, S.J.J., Fahland, D., Aalst, W.M.P.: Discovering block-structured process models from event logs - a constructive approach. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 311–329. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38697-8_17

    Chapter  Google Scholar 

  3. Vázquez-Barreiros, B., Mucientes, M., Lama, M.: Prodigen: mining complete, precise and minimal structure process models with a genetic algorithm. Inf. Sci. 294, 315–333 (2015)

    Article  MathSciNet  Google Scholar 

  4. Han, J., Pei, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Prefixspan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings of the 17th International Conference on Data Engineering, pp. 215–224 (2001)

    Google Scholar 

  5. Tax, N., Sidorova, N., Haakma, R., van der Aalst, W.M.: Mining local process models. J. Innov. Digit. Ecosyst. 3, 183–196 (2016)

    Article  Google Scholar 

  6. Greco, G., Guzzo, A., Manco, G., Pontieri, L., Saccà, D.: Mining constrained graphs: the case of workflow systems. In: Boulicaut, J.-F., Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS, vol. 3848, pp. 155–171. Springer, Heidelberg (2006). doi:10.1007/11615576_8

    Chapter  MATH  Google Scholar 

  7. Conforti, R., La Rosa, M., ter Hofstede, A.H.: Filtering out infrequent behavior from business process event logs. IEEE Trans. Knowl. Data Eng. 29, 300–314 (2016)

    Article  Google Scholar 

  8. Ghionna, L., Greco, G., Guzzo, A., Pontieri, L.: Outlier detection techniques for process mining applications. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds.) ISMIS 2008. LNCS, vol. 4994, pp. 150–159. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68123-6_17

    Chapter  Google Scholar 

  9. Yang, W.S., Hwang, S.Y.: A process-mining framework for the detection of healthcare fraud and abuse. Expert Syst. Appl. 31(1), 56–68 (2006)

    Article  MathSciNet  Google Scholar 

  10. Münz, G., Li, S., Carle, G.: Traffic anomaly detection using k-means clustering. In: GI/ITG Workshop MMBnet (2007)

    Google Scholar 

  11. Lo, D., Cheng, H., Han, J., Khoo, S.C., Sun, C.: Classification of software behaviors for failure detection: a discriminative pattern mining approach. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 557–566. ACM (2009)

    Google Scholar 

  12. Bezerra, F., Wainer, J.: Algorithms for anomaly detection of traces in logs of process aware information systems. Inf. Syst. 38(1), 33–44 (2013)

    Article  Google Scholar 

  13. Lu, X., Fahland, D., Biggelaar, F.J.H.M., Aalst, W.M.P.: Detecting deviating behaviors without models. In: Reichert, M., Reijers, H.A. (eds.) BPM 2015. LNBIP, vol. 256, pp. 126–139. Springer, Cham (2016). doi:10.1007/978-3-319-42887-1_11

    Chapter  Google Scholar 

  14. De Weerdt, J., vanden Broucke, S., Vanthienen, J., Baesens, B.: Active trace clustering for improved process discovery. IEEE Trans. Knowl. Data Eng. 25(12), 2708–2720 (2013)

    Article  Google Scholar 

  15. Desel, J., Reisig, W.: Place/transition petri nets. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 122–173. Springer, Heidelberg (1998). doi:10.1007/3-540-65306-6_15

    Chapter  MATH  Google Scholar 

  16. Aalst, W., Adriansyah, A., Dongen, B.: Causal nets: a modeling language tailored towards process discovery. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 28–42. Springer, Heidelberg (2011). doi:10.1007/978-3-642-23217-6_3

    Chapter  Google Scholar 

  17. Leung, C.K.S.: Monotone Constraints. In: Liu, L., Özsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 1769–1769. Springer, Boston (2009)

    Google Scholar 

Download references

Acknowledgments

This research was supported by the Spanish Ministry of Economy and Competitiveness (grant TIN2014-56633-C3-1-R) and the Galician Ministry of Education, Culture and Universities (grants GRC2014/030 and accreditation 2016-2019, ED431G/08). These grants are co-funded by the European Regional Development Fund (ERDF/FEDER program).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Chapela-Campa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Chapela-Campa, D., Mucientes, M., Lama, M. (2017). Discovering Infrequent Behavioral Patterns in Process Models. In: Carmona, J., Engels, G., Kumar, A. (eds) Business Process Management. BPM 2017. Lecture Notes in Computer Science(), vol 10445. Springer, Cham. https://doi.org/10.1007/978-3-319-65000-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-65000-5_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64999-3

  • Online ISBN: 978-3-319-65000-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics