Incremental Declarative Process Mining

Business organizations achieve their mission by performing a number of processes. These span from simple sequences of actions to complex structured sets of activities with complex interrelation among them. The field of Business Processes Management studies how to describe, analyze, preserve and improve processes. In particular the subfield of Process Mining aims at inferring a model of the processes from logs (i.e. the collected records of performed activities). Moreover, processes can change over time to reflect mutated conditions, therefore it is often necessary to update the model. We call this activity Incremental Process Mining. To solve this problem, we modify the process mining system DPML to obtain IPM (Incremental Process Miner), which employs a subset of the \(\mathcal{S}\)CIFF language to represent models and adopts techniques developed in Inductive Logic Programming to perform theory revision. The experimental results show that is more convenient to revise a theory rather than learning a new one from scratch.

[1]  Ming-Chien Shan,et al.  Business Process Management: 6th International Conference, BPM 2008, Milan, Italy, September 2-4, 2008, Proceedings , 2008, BPM 2008.

[2]  Evelina Lamma,et al.  Exploiting Inductive Logic Programming Techniques for Declarative Process Mining , 2009, Trans. Petri Nets Other Model. Concurr..

[3]  Nicola Fanizzi,et al.  Multistrategy Theory Revision: Induction and Abduction in INTHELEX , 2004, Machine Learning.

[4]  Paola Mello,et al.  Declarative specification and verification of service choreographiess , 2010, TWEB.

[5]  Barry Crabtree,et al.  PAAM 96 : proceedings of the First International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology : 22nd-24th April 1996, Westminster Central Hall, London, UK , 1996 .

[6]  Zbigniew W. Ras,et al.  Methodologies for Intelligent Systems , 1991, Lecture Notes in Computer Science.

[7]  Krzysztof R. Apt,et al.  Acyclic programs , 2009, New Generation Computing.

[8]  Dimitrios Gunopulos,et al.  Mining Process Models from Workflow Logs , 1998, EDBT.

[9]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[10]  De Raedt,et al.  Advances in Inductive Logic Programming , 1996 .

[11]  Evelina Lamma,et al.  Verifiable agent interaction in abductive logic programming: The SCIFF framework , 2008, TOCL.

[12]  Boudewijn F. van Dongen,et al.  Workflow mining: A survey of issues and approaches , 2003, Data Knowl. Eng..

[13]  Patrick Valduriez,et al.  Distributed and parallel database systems , 1996, CSUR.

[14]  Wil M.P. van der Aalst,et al.  Declarative Specification and Verification of Service Choreographies , 2009 .

[15]  Pattie Maes,et al.  Kasbah: An Agent Marketplace for Buying and Selling Goods , 1996, PAAM.

[16]  Wil M. P. van der Aalst,et al.  A Declarative Approach for Flexible Business Processes Management , 2006, Business Process Management Workshops.

[17]  Johann Eder,et al.  Logic and Databases , 1992, Advanced Topics in Artificial Intelligence.

[18]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[19]  Isidro Ramos,et al.  Advances in Database Technology — EDBT'98 , 1998, Lecture Notes in Computer Science.

[20]  Luc De Raedt,et al.  Clausal Discovery , 1997, Machine Learning.

[21]  Manfred Reichert,et al.  Flexibility in Process-Aware Information Systems , 2009, Trans. Petri Nets Other Model. Concurr..

[22]  Amit P. Sheth,et al.  An overview of workflow management: From process modeling to workflow automation infrastructure , 1995, Distributed and Parallel Databases.

[23]  Luc De Raedt,et al.  First-Order jk-Clausal Theories are PAC-Learnable , 1994, Artif. Intell..

[24]  Raymond J. Mooney,et al.  Automated refinement of first-order horn-clause domain theories , 2005, Machine Learning.

[25]  S. Wrobel.  First Order Theory Reenement , 1996 .

[26]  Wil M. P. van der Aalst,et al.  DECLARE: Full Support for Loosely-Structured Processes , 2007, 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007).

[27]  Luc De Raedt,et al.  RUTH: an ILP Theory Revision System , 1994, ISMIS.

[28]  Wil M. P. van der Aalst,et al.  Workflow mining: discovering process models from event logs , 2004, IEEE Transactions on Knowledge and Data Engineering.

[29]  Diogo R. Ferreira,et al.  An Integrated Life Cycle for Workflow Management Based on Learning and Planning , 2006, Int. J. Cooperative Inf. Syst..

[30]  Stefanie Rinderle-Ma,et al.  Analyzing the Dynamic Cost Factors of Process-Aware Information Systems: A Model-Based Approach , 2007, CAiSE.

[31]  Luc De Raedt,et al.  Inductive Constraint Logic , 1995, ALT.

[32]  Luigi Pontieri,et al.  Discovering expressive process models by clustering log traces , 2006, IEEE Transactions on Knowledge and Data Engineering.

[33]  Guido Governatori,et al.  Compliance aware business process design , 2008 .

[34]  Hongjun Lu,et al.  Conceptual Modeling – ER 2004 , 2004, Lecture Notes in Computer Science.

[35]  Luc De Raedt,et al.  Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..

[36]  Evelina Lamma,et al.  Applying Inductive Logic Programming to Process Mining , 2007, ILP.

[37]  Evelina Lamma,et al.  Inducing Declarative Logic-Based Models from Labeled Traces , 2007, BPM.

[38]  Evelina Lamma,et al.  An Abductive Interpretation for Open Agent Societies , 2003, AI*IA.

[39]  Stijn Goedertier,et al.  Declarative Techniques for Modeling and Mining Business Processes , 2008 .

[40]  Boudewijn F. van Dongen,et al.  Multi-phase Process Mining: Building Instance Graphs , 2004, ER.