Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Gunopulos, D., Leymann, F.: Mining process models from workflow logs. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol. 1377, pp. 469–483. Springer, Heidelberg (1998)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of the 20th Int’l Conference on Very Large Databases, pp. 487–499 (1994)
Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proc. 11th Int. Conf. on Data Engineering (ICDE 1995), pp. 3–14 (1995)
Cook, D.J., Holder, L.B.: Substructure Discovery Using Minimum Description Length and Background Knowledge. Journal of Artificial Intelligence Research 1(1), 231–255 (1994)
Cook, J.E., Wolf, A.L.: Automating process discovery through event-data analysis. In: Proc. 17th Int. Conf. on Software Engineering (ICSE 1995), pp. 73–82 (1995)
Cook, J.E., Wolf, A.L.: Event-based detection of concurrency. In: Proc. 6th Int. Symposium on the Foundations of Software Engineering (FSE 1998), pp. 35–45 (1998)
Cook, J.E., Wolf, A.L.: Software process validation: quantitatively measuring the correspondence of a process to a model. ACM Trans. Softw. Eng. Methodol. 8(2), 147–176 (1999)
de Medeiros, A.K.A., van Dongen, B.F., van der Aalst, W.M.P., Weijters, A.J.M.M.: Process mining: Extending the a-algorithm to mine short loops. Technical report, University of Technology, Eindhoven. BETA Working Paper Series, WP 113 (2004)
Dehaspe, L., Toivonen, H.: Discovery of Frequent DATALOG Patterns. Data Mining and Knowledge Discovery 3(1), 7–36 (1999)
Georgakopoulos, D., Hornick, M., Sheth, A.: An overview of workflow management: From process modeling to workflow automation infrastructure. Distributed and Parallel Databases 3(2), 119–153 (1995)
Greco, G., Guzzo, A., Manco, G., Saccà, D.: Mining frequent instances on workflows. In: Whang, K.-Y., Jeon, J., Shim, K., Srivastava, J. (eds.) PAKDD 2003. LNCS (LNAI), vol. 2637, pp. 209–221. Springer, Heidelberg (2003)
Greco, G., Guzzo, A., Pontieri, L., Saccà, D.: Mining expressive process models by clustering workflow traces. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 52–62. Springer, Heidelberg (2004)
Greco, G., Guzzo, A., Manco, G., Saccà, D.: Mining and reasoning on workflows. IEEE Trans. on Data and Knowledge Eng. 17(4), 519–534 (2005)
Han, J., Pei, J., Yi, Y.: Mining frequent patterns without candidate generation. In: Proc. Int. ACM Conf. on Management of Data (SIGMOD 2000), pp. 1–12 (2000)
Herbst, J.: Dealing with concurrency in work?ow induction. In: Procs. European Concurrent Engineering Conference (2000)
Herbst, J., Karagiannis, D.: Integrating machine learning and workflow management to support acquisition and adaptation of workflow models. Journal of Intelligent Systems in Accounting, Finance and Management 9, 67–92 (2000)
Inokuchi, A., Washi, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 13–23. Springer, Heidelberg (2000)
Koksal, P., Arpinar, S.N., Dogac, A.: Workflow history management. SIGMOD Recod 27(1), 67–75 (1998)
Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proc. IEEE Int. Conf. on Data Mining (ICDM 2001), pp. 313–320 (2001)
Motoda, H., Liu, H.: Data reduction: feature selection. In: Handbook of data mining and knowledge discovery, pp. 208–213 (2002)
Lesh, N., Zaki, M.J., Ogihara, M.: Mining features for sequence classification. In: Proc. 6th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2000), pp. 342–346 (1999)
Padmanabhan, B., Tuzhilin, A.: Small is beautiful: discovering the minimal set of unexpected patterns. In: Proc. 6th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2000), pp. 54–63 (2000)
Parekh, R., Honavar, V.: Grammar Inference, Automata Induction and Language Acquisition. In: Handbook of Natural Language Processing. Marcel Dekker, New York (2000)
Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-Mine: Hyper-structure mining of frequent patterns in large databases. In: Proc. IEEE Int. Conf. on Data Mining (ICDM 2001), pp. 441–448 (2001)
Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Prefixspan: Mining sequential patterns by prefix-projected growth. In: Proc. IEEE Int. Conf. on Data Engineering (ICDE 2001), pp. 215–224 (2001)
Schimm, G.: Mining most specific workflow models from event-based data. Business Process Management, 25–40 (2003)
van der Aalst, W.M.P., van Dongen, B.F.: Discovering workflow performance models from timed logs. In: Han, Y., Tai, S., Wikarski, D. (eds.) EDCIS 2002. LNCS, vol. 2480, pp. 45–63. Springer, Heidelberg (2002)
van der Aalst, W.M.P., van Dongen, B.F., Herbst, J., Maruster, L., Schimm, G., Weijters, A.J.M.M.: Workflow mining: A survey of issues and approaches. Data and Knowledge Engineering 47(2), 237–267 (2003)
van der Aalst, W.M.P., van Hee, K.M.: Workflow Management: Models, Methods, and Systems. MIT Press, Cambridge (2002)
van der Aalst, W.M.P., Weijters, A.J.M.M., Maruster, L.: Workflow mining: Discovering process models from event logs. IEEE Transactions on Knowledge and Data Engineering (TKDE) (to appear)
Yan, X., Han, J.: gSpan: Graph-based substructure pattern pining. In: Proc. IEEE Int. Conf. on Data Mining (ICDM 2002) (2001); An extended version appeared as UIUC-CS Tech. Report: R-2002-2296
Yan, X., Han, J.: CloseGraph: Mining closed frequent graph patterns. In: Proc. ACM Int. Conf. on Knowledge Discovery and Data Mining (KDD 2003), pp. 286–295 (2003)
Yoshida, K., Motoda, H., Indurkhya, N.: Graph- based induction as a unified learning framework. Journal of Applied Intel 4, 297–328 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greco, G., Guzzo, A., Manco, G., Pontieri, L., Saccà, D. (2006). Mining Constrained Graphs: The Case of Workflow Systems. In: Boulicaut, JF., De Raedt, L., Mannila, H. (eds) Constraint-Based Mining and Inductive Databases. Lecture Notes in Computer Science(), vol 3848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11615576_8
Download citation
DOI: https://doi.org/10.1007/11615576_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31331-1
Online ISBN: 978-3-540-31351-9
eBook Packages: Computer ScienceComputer Science (R0)