메뉴 건너뛰기




Volumn 24, Issue 1, 2012, Pages 218-246

Projection approaches to process mining using region-based techniques

Author keywords

Petri nets; Process mining; Theory of regions

Indexed keywords

AUTOMATED DISCOVERY; CENTRAL PROBLEMS; EFFICIENT ALGORITHM; EVENT-BASED; FORMAL REASONING; HEALTH CARE APPLICATION; IN-PROCESS; OVER FITTING PROBLEM; PROCESS MINING; PROCESS MODEL; PROJECTION TECHNIQUES; REGION-BASED; STATE-BASED; THEORY OF REGIONS;

EID: 84856596133     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-011-0226-x     Document Type: Article
Times cited : (24)

References (50)
  • 2
    • 84957675725 scopus 로고
    • Polynomial algorithms for the synthesis of bounded nets. In: Theory and practice of software (TAPSOFT)
    • Badouel E, Bernardinello L, Darondeau P (1995) Polynomial algorithms for the synthesis of bounded nets. In: Theory and practice of software (TAPSOFT). Lecture notes in computer science, vol 915. pp 364-383
    • (1995) Lecture Notes in Computer Science , vol.915 , pp. 364-383
    • Badouel, E.1    Bernardinello, L.2    Darondeau, P.3
  • 4
    • 58149528197 scopus 로고    scopus 로고
    • Synthesis of Petri nets from finite partial languages
    • 1167.68037 2487904
    • R Bergenthum J Desel R Lorenz S Mauser 2008 Synthesis of Petri nets from finite partial languages Fundam Inform 88 4 437 468 1167.68037 2487904
    • (2008) Fundam Inform , vol.88 , Issue.4 , pp. 437-468
    • Bergenthum, R.1    Desel, J.2    Lorenz, R.3    Mauser, S.4
  • 5
    • 70349471529 scopus 로고    scopus 로고
    • Divide-and-conquer strategies for process mining
    • Software Department, Universitat Politècnica de Catalunya
    • Carmona J, Cortadella J, Kishinevsky M (2008a) Divide-and-conquer strategies for process mining. Tech. Rep. LSI-08-35-R, Software Department, Universitat Politècnica de Catalunya
    • (2008) Tech. Rep. LSI-08-35-R
    • Carmona, J.1    Cortadella, J.2    Kishinevsky, M.3
  • 9
    • 76549086747 scopus 로고    scopus 로고
    • New region-based algorithms for deriving bounded Petri nets
    • 10.1109/TC.2009.131 10.1109/TC.2009.131 2647930
    • J Carmona J Cortadella M Kishinevsky 2009 New region-based algorithms for deriving bounded Petri nets IEEE Trans Comp 59 3 371 384 10.1109/TC.2009.131 10.1109/TC.2009.131 2647930
    • (2009) IEEE Trans Comp , vol.59 , Issue.3 , pp. 371-384
    • Carmona, J.1    Cortadella, J.2    Kishinevsky, M.3
  • 10
    • 0032108294 scopus 로고    scopus 로고
    • Discovering models of software processes from event-based data
    • 10.1145/287000.287001
    • JE Cook AL Wolf 1998 Discovering models of software processes from event-based data ACM Trans Softw Eng Methodol 7 3 215 249 10.1145/287000.287001
    • (1998) ACM Trans Softw Eng Methodol , vol.7 , Issue.3 , pp. 215-249
    • Cook, J.E.1    Wolf, A.L.2
  • 11
    • 0010646357 scopus 로고    scopus 로고
    • Deriving Petri nets from finite transition systems
    • 10.1109/12.707587 1645386
    • J Cortadella M Kishinevsky L Lavagno A Yakovlev 1998 Deriving Petri nets from finite transition systems IEEE Trans Comput 47 8 859 882 10.1109/12.707587 1645386
    • (1998) IEEE Trans Comput , vol.47 , Issue.8 , pp. 859-882
    • Cortadella, J.1    Kishinevsky, M.2    Lavagno, L.3    Yakovlev, A.4
  • 13
    • 0030533613 scopus 로고    scopus 로고
    • The synthesis problem of Petri nets
    • 10.1007/s002360050046 1395200
    • J Desel W Reisig 1996 The synthesis problem of Petri nets Acta Informatica 33 4 297 315 10.1007/s002360050046 1395200
    • (1996) Acta Informatica , vol.33 , Issue.4 , pp. 297-315
    • Desel, J.1    Reisig, W.2
  • 16
    • 0025405313 scopus 로고
    • Partial (Set) 2-structures. Part I, II
    • 10.1007/BF00264611 0696.68082 1045460
    • A Ehrenfeucht G Rozenberg 1990 Partial (Set) 2-structures. Part I, II Acta Informatica 27 315 368 10.1007/BF00264611 0696.68082 1045460
    • (1990) Acta Informatica , vol.27 , pp. 315-368
    • Ehrenfeucht, A.1    Rozenberg, G.2
  • 18
    • 44649129189 scopus 로고    scopus 로고
    • Outlier detection techniques for process mining applications
    • Toronto, Canada, 20-23 May 2008. Proceedings. Lecture notes in computer science Springer, Berlin
    • Ghionna L, Greco G, Guzzo A, Pontieri L (2008) Outlier detection techniques for process mining applications. In: Foundations of intelligent systems, 17th international symposium, ISMIS 2008, Toronto, Canada, 20-23 May 2008. Proceedings. Lecture notes in computer science, vol 4994. Springer, Berlin, pp 150-159
    • (2008) Foundations of Intelligent Systems, 17th International Symposium, ISMIS 2008 , vol.4994 , pp. 150-159
    • Ghionna, L.1    Greco, G.2    Guzzo, A.3    Pontieri, L.4
  • 19
    • 33746334454 scopus 로고    scopus 로고
    • Discovering expressive process models by clustering log traces
    • 10.1109/TKDE.2006.123
    • G Greco A Guzzo L Pontieri D Saccà 2006 Discovering expressive process models by clustering log traces IEEE Trans Knowl Data Eng 18 8 1010 1027 10.1109/TKDE.2006.123
    • (2006) IEEE Trans Knowl Data Eng , vol.18 , Issue.8 , pp. 1010-1027
    • Greco, G.1    Guzzo, A.2    Pontieri, L.3    Saccà, D.4
  • 22
    • 0023365727 scopus 로고
    • Statecharts: A visual formulation for complex systems
    • 10.1016/0167-6423(87)90035-9 0637.68010 896004
    • D Harel 1987 Statecharts: A visual formulation for complex systems Sci Comput Program 8 3 231 274 10.1016/0167-6423(87)90035-9 0637.68010 896004
    • (1987) Sci Comput Program , vol.8 , Issue.3 , pp. 231-274
    • Harel, D.1
  • 23
    • 0018005391 scopus 로고
    • Communicating sequential processes
    • Hoare CAR (1978) Communicating sequential processes. In: Communications of the ACM, pp 666-677
    • (1978) Communications of the ACM , pp. 666-677
    • Car, H.1
  • 25
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • 0333.05001
    • BW Kernighan S Lin 1970 An efficient heuristic procedure for partitioning graphs Bell Syst Tech J 49 1 291 307 0333.05001
    • (1970) Bell Syst Tech J , vol.49 , Issue.1 , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2
  • 26
    • 33749620377 scopus 로고    scopus 로고
    • Process mining and Petri net synthesis
    • Eder J, Dustdar S (eds) Springer, Heidelberg
    • Kindler E, Rubin V, Schäfer W (2006) Process mining and Petri net synthesis. In: Eder J, Dustdar S (eds) Business process management workshops. Lecture notes in computer science, vol 4103. Springer, Heidelberg, pp 105-116
    • (2006) Business Process Management Workshops. Lecture Notes in Computer Science , vol.4103 , pp. 105-116
    • Kindler, E.R.1
  • 27
    • 33745107289 scopus 로고    scopus 로고
    • A rule-based approach for process discovery: Dealing with noise and imbalance in process logs
    • 10.1007/s10618-005-0029-z 2239684
    • L Maruster AJMM Weijters WMP van der Aalst A van den Bosch 2006 A rule-based approach for process discovery: Dealing with noise and imbalance in process logs Data Min Knowl Discov 13 1 67 87 10.1007/s10618-005-0029-z 2239684
    • (2006) Data Min Knowl Discov , vol.13 , Issue.1 , pp. 67-87
    • Maruster, L.1    Ajmm, W.2    Van Der Aalst, W.M.P.3    Van Den Bosch, A.4
  • 28
    • 84947280188 scopus 로고    scopus 로고
    • Parameterized verification of the flash cache coherence protocol by compositional model checking
    • Margaria T, Melham TF (eds) Springer, Heidelberg
    • McMillan KL (2001) Parameterized verification of the flash cache coherence protocol by compositional model checking. In: Margaria T, Melham TF (eds) Correct hardware design and verification methods (CHARME). Lecture notes in computer science, vol 2144. Springer, Heidelberg, pp 179-195
    • (2001) Correct Hardware Design and Verification Methods (CHARME). Lecture Notes in Computer Science , vol.2144 , pp. 179-195
    • McMillan, K.L.1
  • 31
    • 33947207063 scopus 로고    scopus 로고
    • Genetic process mining: An experimental evaluation
    • 10.1007/s10618-006-0061-7 2364274
    • AKA Medeiros AJMM Weijters WMP van der Aalst 2007 Genetic process mining: an experimental evaluation Data Min Knowl Discov 14 2 245 304 10.1007/s10618-006-0061-7 2364274
    • (2007) Data Min Knowl Discov , vol.14 , Issue.2 , pp. 245-304
    • Medeiros, A.K.A.1    Ajmm, W.2    Van Der Aalst, W.M.P.3
  • 33
    • 0000873334 scopus 로고
    • Petri nets and step transition systems
    • 10.1142/S0129054192000231 0774.68086 1209556
    • M Mukund 1992 Petri nets and step transition systems Int J Found Comp Sci 3 4 443 478 10.1142/S0129054192000231 0774.68086 1209556
    • (1992) Int J Found Comp Sci , vol.3 , Issue.4 , pp. 443-478
    • Mukund, M.1
  • 34
    • 0024645936 scopus 로고
    • Petri nets: Properties, analysis and applications
    • 10.1109/5.24143
    • T Murata 1989 Petri nets: properties, analysis and applications Proc IEEE 77 541 580 10.1109/5.24143
    • (1989) Proc IEEE , vol.77 , pp. 541-580
    • Murata, T.1
  • 36
    • 35748949584 scopus 로고    scopus 로고
    • Conformance checking of processes based on monitoring real behavior
    • 10.1016/j.is.2007.07.001
    • A Rozinat WMP van der Aalst 2008 Conformance checking of processes based on monitoring real behavior Inf Syst 33 1 64 95 10.1016/j.is.2007.07.001
    • (2008) Inf Syst , vol.33 , Issue.1 , pp. 64-95
    • Rozinat, A.1    Van Der Aalst, W.M.P.2
  • 37
    • 35748937315 scopus 로고    scopus 로고
    • Component refinement and csc-solving for stg decomposition
    • 1143.68055 2368299
    • M Schaefer W Vogler 2007 Component refinement and csc-solving for stg decomposition Theor Comp Sci 388 1-3 243 266 1143.68055 2368299
    • (2007) Theor Comp Sci , vol.388 , Issue.13 , pp. 243-266
    • Schaefer, M.1    Vogler, W.2
  • 38
    • 0001410753 scopus 로고    scopus 로고
    • Linear algebraic and linear programming techniques for the analysis of place/transition net systems
    • W. Reisig G. Rozenberg (eds). Springer Berlin
    • Silva M, Teruel E, Colom JM (1998) Linear algebraic and linear programming techniques for the analysis of place/transition net systems. In: Reisig W, Rozenberg G (eds) Lecture notes in computer science: lectures on Petri nets I: basic models, vol 1491. Springer, Berlin, pp 309-373
    • (1998) Lecture Notes in Computer Science: Lectures on Petri Nets I: Basic Models, Vol 1491 , pp. 309-373
    • Silva, M.1    Teruel, E.2    Colom, J.M.3
  • 39
    • 58049169828 scopus 로고    scopus 로고
    • Going with the flow: Parameterized verification using message flows
    • Cimatti A, Jones RB (eds) IEEE Press, Los Alamitos
    • Talupur M, Tuttle MR (2008) Going with the flow: Parameterized verification using message flows. In: Cimatti A, Jones RB (eds) Formal methods in computer-aided design (FMCAD), IEEE Press, Los Alamitos, pp 1-8
    • (2008) Formal Methods in Computer-aided Design (FMCAD) , pp. 1-8
    • Talupur, M.1    Tuttle, M.R.2
  • 42
    • 4544353101 scopus 로고    scopus 로고
    • Workflow mining: Discovering process models from event logs
    • 10.1109/TKDE.2004.47
    • W van der Aalst T Weijters L Maruster 2004 Workflow mining: Discovering process models from event logs IEEE Trans Knowl Data Eng 16 9 1128 1142 10.1109/TKDE.2004.47
    • (2004) IEEE Trans Knowl Data Eng , vol.16 , Issue.9 , pp. 1128-1142
    • Van Der Aalst, W.1    Weijters, T.2    Maruster, L.3
  • 43
    • 72549107971 scopus 로고    scopus 로고
    • Process mining: A two-step approach to balance between underfitting and overfitting
    • van der Aalst W, Rubin V, Verbeek HMWE, Dongen B, Kindler E, Günther, C (2009) Process mining: a two-step approach to balance between underfitting and overfitting. Softw Syst Model 9(1):87-111 (2010)
    • (2009) Softw Syst Model , vol.9 , Issue.1 , pp. 87-111
    • Van Der Aalst, W.R.1
  • 45
    • 0003310162 scopus 로고
    • Modular construction and partial order semantics of Petri nets
    • Springer, Heidelberg
    • Vogler W (1992) Modular construction and partial order semantics of Petri nets. In: LNCS, vol 625. Springer, Heidelberg
    • (1992) LNCS , vol.625
    • Vogler, W.1
  • 46
    • 0026191188 scopus 로고
    • Ratio cut partitioning for hierarchical designs
    • 10.1109/43.87601 10.1109/43.87601
    • YC Wei CK Cheng 1991 Ratio cut partitioning for hierarchical designs IEEE Trans Comput-Aided Des Integr Circuits Syst 10 7 911 921 10.1109/43.87601 10.1109/43.87601
    • (1991) IEEE Trans Comput-Aided des Integr Circuits Syst , vol.10 , Issue.7 , pp. 911-921
    • Wei, Y.C.1    Cheng, C.K.2
  • 47
    • 84883435609 scopus 로고    scopus 로고
    • Mining process models with non-free-choice constructs
    • 10.1007/s10618-007-0065-y 2409784
    • L Wen WMP van der Aalst J Wang J Sun 2007 Mining process models with non-free-choice constructs Data Min Knowl Discov 15 2 145 180 10.1007/s10618-007-0065-y 2409784
    • (2007) Data Min Knowl Discov , vol.15 , Issue.2 , pp. 145-180
    • Wen, L.1    Van Der Aalst, W.M.P.2    Wang, J.3    Sun, J.4
  • 48
    • 62249195621 scopus 로고    scopus 로고
    • A novel approach for process mining based on event types
    • 10.1007/s10844-007-0052-1
    • L Wen J Wang W van der Aalst B Huang J Sun 2009 A novel approach for process mining based on event types J Intell Inf Syst 32 163 190 10.1007/s10844-007-0052-1
    • (2009) J Intell Inf Syst , vol.32 , pp. 163-190
    • Wen, L.1    Wang, J.2    Van Der Aalst, W.3    Huang, B.4    Sun, J.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.