Mining Constrained Graphs: The Case of Workflow Systems

Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the precedence relationship among such activities. Typically, nodes and edges can specify some constraints, which control the interaction among the activities. Faced with the above features constrained graphs are widely used in the modelling and analysis of Workflow processes. In this paper we overview two mining problems related to the analysis of constrained graphs, namely the analysis of frequent patterns of execution, and the induction of a constrained graph from a set of execution traces. We discuss some complexity aspects related to the problem of reasoning and mining on constrained graphs, and overview two algorithms for the mentioned problems.

[1]  Domenico Saccà,et al.  Mining Frequent Instances on Workflows , 2003, PAKDD.

[2]  Balaji Padmanabhan,et al.  Small is beautiful: discovering the minimal set of unexpected patterns , 2000, KDD '00.

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

[4]  Alexander L. Wolf,et al.  Software process validation: quantitatively measuring the correspondence of a process to a model , 1999, TSEM.

[5]  Luigi Pontieri,et al.  Mining Expressive Process Models by Clustering Workflow Traces , 2004, PAKDD.

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

[7]  Joachim Herbst,et al.  Dealing with Concurrency in Workflow Induction , 2000 .

[8]  van der Wmp Wil Aalst,et al.  Process Mining , 2005, Process-Aware Information Systems.

[9]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[10]  Hannu Toivonen,et al.  Discovery of frequent DATALOG patterns , 1999, Data Mining and Knowledge Discovery.

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

[12]  Hiroshi Motoda,et al.  Data reduction: feature selection , 2002 .

[13]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[14]  Wil vanderAalst,et al.  Workflow Management: Models, Methods, and Systems , 2004 .

[15]  Yanbo Han,et al.  Engineering and Deployment of Cooperative Information Systems , 2002, Lecture Notes in Computer Science.

[16]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[17]  Alexander L. Wolf,et al.  Automating Process Discovery through Event-Data Analysis , 1995, 1995 17th International Conference on Software Engineering.

[18]  Jan Komorowski,et al.  Principles of Data Mining and Knowledge Discovery , 2001, Lecture Notes in Computer Science.

[19]  Dimitris Karagiannis,et al.  Integrating machine learning and workflow management to support acquisition and adaptation of workflow models , 2000 .

[20]  Rajesh Parekh,et al.  Grammar Inference Automata Induction and Language Acquisition , 2005 .

[21]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

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

[23]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[24]  Domenico Saccà,et al.  Mining and reasoning on workflows , 2005, IEEE Transactions on Knowledge and Data Engineering.

[25]  Boudewijn F. van Dongen,et al.  Discovering Workflow Performance Models from Timed Logs , 2002, EDCIS.

[26]  Hongjun Lu,et al.  H-mine: hyper-structure mining of frequent patterns in large databases , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[27]  Guido Schimm,et al.  Mining Most Specific Workflow Models from Event-Based Data , 2003, Business Process Management.

[28]  Asuman Dogac,et al.  Workflow history management , 1998, SGMD.

[29]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[30]  Alexander L. Wolf,et al.  Event-Based Detection of Concurrency , 2006 .

[31]  Mohammed J. Zaki,et al.  Mining features for sequence classification , 1999, KDD '99.

[32]  Jiawei Han,et al.  CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.

[33]  George Karypis,et al.  Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

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

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

[36]  Umeshwar Dayal,et al.  PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth , 2001, ICDE 2001.

[37]  Lawrence B. Holder,et al.  Substructure Discovery Using Minimum Description Length and Background Knowledge , 1993, J. Artif. Intell. Res..

[38]  Wil M.P. van der Aalst,et al.  Process Mining : Extending the α-algorithm to Mine Short Loops , 2004 .

[39]  Hiroshi Motoda,et al.  Graph-based induction as a unified learning framework , 1994, Applied Intelligence.