메뉴 건너뛰기




Volumn 62, Issue , 2016, Pages 42-59

Do activity lifecycles affect the validity of a business rule in a business process?

Author keywords

Activity lifecycle; Discriminative mining; Linear temporal logic; Non atomic activities; Process discovery; Rule mining

Indexed keywords

ATOMS; DATA MINING; LIFE CYCLE;

EID: 84977111802     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2016.06.002     Document Type: Article
Times cited : (28)

References (58)
  • 1
    • 79955792399 scopus 로고    scopus 로고
    • Process Mining: Discovery, Conformance and Enhancement of Business Processes
    • Springer New York, USA
    • [1] van der Aalst, W., Process Mining: Discovery, Conformance and Enhancement of Business Processes. 2011, Springer, New York, USA.
    • (2011)
    • van der Aalst, W.1
  • 3
    • 79961206380 scopus 로고    scopus 로고
    • User-guided discovery of declarative process models
    • in: CIDM, Paris, France, IEEE, New York, URL 〈〉
    • [3] F.M. Maggi, A.J. Mooij, W.M.P. van der Aalst, User-guided discovery of declarative process models, in: CIDM, Paris, France, IEEE, New York, 2011, pp. 192–199. URL 〈 http://dx.doi.org/10.1109/CIDM.2011.5949297〉.
    • (2011) , pp. 192-199
    • Maggi, F.M.1    Mooij, A.J.2    Van Der Aalst, W.M.P.3
  • 4
    • 84867795158 scopus 로고    scopus 로고
    • Efficient discovery of understandable declarative process models from event logs
    • in: J. Ralyté, X. Franch, S. Brinkkemper, S. Wrycza (Eds.), CAiSE, Lecture Notes in Computer Science, Gdańsk, Poland, vol. 7328, Springer, New York, URL 〈〉
    • [4] F.M. Maggi, R.P.J.C. Bose, W.M.P. van der Aalst, Efficient discovery of understandable declarative process models from event logs, in: J. Ralyté, X. Franch, S. Brinkkemper, S. Wrycza (Eds.), CAiSE, Lecture Notes in Computer Science, Gdańsk, Poland, vol. 7328, Springer, New York, 2012, pp. 270–285, URL 〈 http://dx.doi.org/10.1007/978-3-642-31095-9_18〉.
    • (2012) , pp. 270-285
    • Maggi, F.M.1    Bose, R.P.J.C.2    Van der Aalst, W.M.P.3
  • 5
    • 84879849024 scopus 로고    scopus 로고
    • A knowledge-based integrated approach for discovering and repairing declare maps, in: C. Salinesi, M.C. Norrie, O. Pastor (Eds.), CAiSE, Lecture Notes in Computer Science, Valencia, Spain, vol. 7908, Springer, New York, URL 〈〉
    • [5] F.M. Maggi, R.P.J.C. Bose, W.M.P. van der Aalst, A knowledge-based integrated approach for discovering and repairing declare maps, in: C. Salinesi, M.C. Norrie, O. Pastor (Eds.), CAiSE, Lecture Notes in Computer Science, Valencia, Spain, vol. 7908, Springer, New York, 2013, pp. 433–448, URL 〈 http://dx.doi.org/10.1007/978-3-642-38709-8_28〉.
    • (2013) , pp. 433-448
    • Maggi, F.M.1    Bose, R.P.J.C.2    Van der Aalst, W.M.P.3
  • 6
    • 84897714794 scopus 로고    scopus 로고
    • Declarative process mining with the declare component of ProM, in: M.-C. Fauvet, B.F. van Dongen (Eds.), BPM (Demos), CEUR Workshop Proceedings, vol. 1021, CEUR-WS.org, . URL 〈〉
    • [6] F.M. Maggi, Declarative process mining with the declare component of ProM, in: M.-C. Fauvet, B.F. van Dongen (Eds.), BPM (Demos), CEUR Workshop Proceedings, vol. 1021, CEUR-WS.org, 2013. URL 〈 http://ceur-ws.org/Vol-1021/paper_8.pdf〉.
    • (2013)
    • Maggi, F.M.1
  • 7
    • 38049165950 scopus 로고    scopus 로고
    • Inducing declarative logic-based models from labeled traces, in: G. Alonso, P. Dadam, M. Rosemann (Eds.), BPM, Lecture Notes in Computer Science, Brisbane, Australia, vol. 4714 Springer, New York, URL 〈〉
    • [7] E. Lamma, P. Mello, M. Montali, F. Riguzzi, S. Storari, Inducing declarative logic-based models from labeled traces, in: G. Alonso, P. Dadam, M. Rosemann (Eds.), BPM, Lecture Notes in Computer Science, Brisbane, Australia, vol. 4714 Springer, New York, 2007, pp. 344–359. URL 〈 http://dx.doi.org/10.1007/978-3-540-75183-0_25〉.
    • (2007) , pp. 344-359
    • Lamma, E.1    Mello, P.2    Montali, M.3    Riguzzi, F.4    Storari, S.5
  • 8
    • 40249111624 scopus 로고    scopus 로고
    • Applying inductive logic programming to process mining
    • in: H. Blockeel, J. Ramon, J.W. Shavlik, P. Tadepalli (Eds.), ILP, Lecture Notes in Computer Science, Corvallis, OR, USA, vol. 4894, Springer, New York, URL 〈〉
    • [8] E. Lamma, P. Mello, F. Riguzzi, S. Storari, Applying inductive logic programming to process mining, in: H. Blockeel, J. Ramon, J.W. Shavlik, P. Tadepalli (Eds.), ILP, Lecture Notes in Computer Science, Corvallis, OR, USA, vol. 4894, Springer, New York, 2007, pp. 132–146, URL 〈 http://dx.doi.org/10.1007/978-3-540-78469-2_16〉.
    • (2007) , pp. 132-146
    • Lamma, E.1    Mello, P.2    Riguzzi, F.3    Storari, S.4
  • 9
    • 84883435609 scopus 로고    scopus 로고
    • Probabilistic logic-based process mining
    • in: W. Faber, N. Leone (Eds.), CILC, CEUR Workshop Proceedings, Springer, Berlin, Heidelberg, vol. 598, CEUR-WS.org, Raleigh, North Carolina, USA, URL 〈〉
    • [9] E. Bellodi, F. Riguzzi, E. Lamma, Probabilistic logic-based process mining, in: W. Faber, N. Leone (Eds.), CILC, CEUR Workshop Proceedings, Springer, Berlin, Heidelberg, vol. 598, CEUR-WS.org, Raleigh, North Carolina, USA, 2010, URL 〈 http://ceur-ws.org/Vol-598/paper17.pdf〉.
    • (2010)
    • Bellodi, E.1    Riguzzi, F.2    Lamma, E.3
  • 10
    • 78049409671 scopus 로고    scopus 로고
    • Probabilistic declarative process mining
    • in: Y. Bi, M.-A. Williams (Eds.), KSEM, Lecture Notes in Computer Science, vol. 6291, Springer, URL 〈〉
    • [10] E. Bellodi, F. Riguzzi, E. Lamma, Probabilistic declarative process mining, in: Y. Bi, M.-A. Williams (Eds.), KSEM, Lecture Notes in Computer Science, vol. 6291, Springer, 2010, pp. 292–303, URL 〈 http://dx.doi.org/10.1007/978-3-642-15280-1_28〉.
    • (2010) , pp. 292-303
    • Bellodi, E.1    Riguzzi, F.2    Lamma, E.3
  • 11
    • 84885659827 scopus 로고    scopus 로고
    • A two-step fast algorithm for the automated discovery of declarative workflows, in: 4th IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2013, Singapore, April 16–19, 2013, IEEE, New York, URL 〈〉
    • [11] C. Di Ciccio, M. Mecella, A two-step fast algorithm for the automated discovery of declarative workflows, in: 4th IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2013, Singapore, April 16–19, 2013, IEEE, New York, 2013, pp. 135–142, URL 〈 http://dx.doi.org/10.1109/CIDM.2013.6597228〉.
    • (2013) , pp. 135-142
    • Di Ciccio, C.1    Mecella, M.2
  • 12
    • 84961797482 scopus 로고    scopus 로고
    • Online discovery of declarative process models from event streams
    • ISSN: 1939-1374
    • [12] Burattin, A., Cimitile, M., Maggi, F.M., Sperduti, A., Online discovery of declarative process models from event streams. IEEE Trans. Services Comput. 8:6 (2015), 833–846, 10.1109/TSC.2015.2459703 ISSN: 1939-1374.
    • (2015) IEEE Trans. Services Comput. , vol.8 , Issue.6 , pp. 833-846
    • Burattin, A.1    Cimitile, M.2    Maggi, F.M.3    Sperduti, A.4
  • 13
    • 84909992217 scopus 로고    scopus 로고
    • Log-based understanding of business processes through temporal logic query checking
    • in: R. Meersman, H. Panetto, T.S. Dillon, M. Missikoff, L. Liu, O. Pastor, A. Cuzzocrea, T. Sellis (Eds.), On the Move to Meaningful Internet Systems: OTM 2014 Conferences—Confederated International Conferences: CoopIS, and ODBASE 2014, Amantea, Italy, October 27–31, 2014, Proceedings, Springer, Berlin, Heidelberg, URL 〈〉
    • [13] M. Räim, C. Di Ciccio, F.M. Maggi, M. Mecella, J. Mendling, Log-based understanding of business processes through temporal logic query checking, in: R. Meersman, H. Panetto, T.S. Dillon, M. Missikoff, L. Liu, O. Pastor, A. Cuzzocrea, T. Sellis (Eds.), On the Move to Meaningful Internet Systems: OTM 2014 Conferences—Confederated International Conferences: CoopIS, and ODBASE 2014, Amantea, Italy, October 27–31, 2014, Proceedings, Springer, Berlin, Heidelberg, 2014, pp. 75–92, URL 〈 http://dx.doi.org/10.1007/978-3-662-45563-0_5〉.
    • (2014) , pp. 75-92
    • Räim, M.1    Di Ciccio, C.2    Maggi, F.3    Mecella, M.4    Mendling, J.5
  • 14
    • 84872797203 scopus 로고    scopus 로고
    • Looking into the future. Using timed automata to provide a priori advice about timed declarative process models
    • in: R. Meersman, H. Panetto, T.S. Dillon, S. Rinderle-Ma, P. Dadam, X. Zhou, S. Pearson, A. Ferscha, S. Bergamaschi, I.F. Cruz (Eds.), On the Move to Meaningful Internet Systems: OTM 2012, Confederated International Conferences: CoopIS, DOA-SVI, and ODBASE Rome, Italy, September 10–14, 2012. Proceedings, Part I, Lecture Notes in Computer Science, vol. 7565, Springer, Berlin, Heidelberg, 2012, pp. 250–267, URL 〈〉
    • [14] M. Westergaard, F.M. Maggi, Looking into the future. Using timed automata to provide a priori advice about timed declarative process models, in: R. Meersman, H. Panetto, T.S. Dillon, S. Rinderle-Ma, P. Dadam, X. Zhou, S. Pearson, A. Ferscha, S. Bergamaschi, I.F. Cruz (Eds.), On the Move to Meaningful Internet Systems: OTM 2012, Confederated International Conferences: CoopIS, DOA-SVI, and ODBASE 2012, Rome, Italy, September 10–14, 2012. Proceedings, Part I, Lecture Notes in Computer Science, vol. 7565, Springer, Berlin, Heidelberg, 2012, pp. 250–267, URL 〈 http://dx.doi.org/10.1007/978-3-642-33606-5_16〉.
    • (2012)
    • Westergaard, M.1    Maggi, F.M.2
  • 16
    • 84881226993 scopus 로고    scopus 로고
    • Discovering data-aware declarative process models from event logs
    • in: F. Daniel, J. Wang, B. Weber (Eds.), BPM, Lecture Notes in Computer Science, vol. 8094, Springer, Berlin, Heidelberg, URL 〈〉
    • [16] F.M. Maggi, M. Dumas, L. García-Bañuelos, M. Montali, Discovering data-aware declarative process models from event logs, in: F. Daniel, J. Wang, B. Weber (Eds.), BPM, Lecture Notes in Computer Science, vol. 8094, Springer, Berlin, Heidelberg, 2013, pp. 81–96, URL 〈 http://dx.doi.org/10.1007/978-3-642-40176-3_8〉.
    • (2013) , pp. 81-96
    • Maggi, F.M.1    Dumas, M.2    García-Bañuelos, L.3    Montali, M.4
  • 17
    • 84906776604 scopus 로고    scopus 로고
    • Discovering target-branched declare constraints
    • in: S.W. Sadiq, P. Soffer, H. Völzer (Eds.), Business Process Management—12th International Conference, BPM 2014, Haifa, Israel, September 7–11, 2014, Lecture Notes in Computer Science, vol. 8659, Springer, Berlin, Heidelberg, URL 〈〉
    • [17] C. Di Ciccio, F.M. Maggi, J. Mendling, Discovering target-branched declare constraints, in: S.W. Sadiq, P. Soffer, H. Völzer (Eds.), Business Process Management—12th International Conference, BPM 2014, Haifa, Israel, September 7–11, 2014, Lecture Notes in Computer Science, vol. 8659, Springer, Berlin, Heidelberg, 2014, pp. 34–50, URL 〈 http://dx.doi.org/10.1007/978-3-319-10172-9_3〉.
    • (2014) , pp. 34-50
    • Di Ciccio, C.1    Maggi, F.2    Mendling, J.3
  • 18
    • 84905252959 scopus 로고    scopus 로고
    • Using discriminative rule mining to discover declarative process models with non-atomic activities
    • RuleML 2014, Co-located with the 21st European Conference on Artificial Intelligence, ECAI 2014, Prague, Czech Republic, August 18–20, 2014, Proceedings, URL 〈〉
    • [18] M.L. Bernardi, M. Cimitile, C. Di Francescomarino, F. M. Maggi, Using discriminative rule mining to discover declarative process models with non-atomic activities, in: Rules on the Web. From Theory to Applications—8th International Symposium, RuleML 2014, Co-located with the 21st European Conference on Artificial Intelligence, ECAI 2014, Prague, Czech Republic, August 18–20, 2014, Proceedings, 2014, pp. 281–295, URL 〈 http://dx.doi.org/10.1007/978-3-319-09870-8_21〉.
    • (2014) in: Rules on the Web. From Theory to Applications—8th International Symposium , pp. 281-295
    • Bernardi, M.L.1    Cimitile, M.2    Di Francescomarino, C.3    Maggi, F.M.4
  • 19
    • 47949131563 scopus 로고    scopus 로고
    • DECLARE: full support for loosely-structured processes, in: 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007), 15–19 October 2007, Annapolis, Maryland, USA, URL 〈〉
    • [19] M. Pesic, H. Schonenberg, W.M.P. van der Aalst, DECLARE: full support for loosely-structured processes, in: 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007), 15–19 October 2007, Annapolis, Maryland, USA, 2007, pp. 287–300, URL 〈 http://dx.doi.org/10.1109/EDOC.2007.25〉.
    • (2007) , pp. 287-300
    • Pesic, M.1    Schonenberg, H.2    Van der Aalst, W.M.P.3
  • 20
    • 84870666515 scopus 로고    scopus 로고
    • Techniques for a posteriori analysis of declarative processes
    • in: C. Chi, D. Gasevic, W. van den Heuvel (Eds.), 16th IEEE International Enterprise Distributed Object Computing Conference, EDOC 2012, Beijing, China, September 10-14, 2012, IEEE, New York, 2012, URL 〈〉
    • [20] A. Burattin, F.M. Maggi, W.M.P. van der Aalst, A. Sperduti, Techniques for a posteriori analysis of declarative processes, in: C. Chi, D. Gasevic, W. van den Heuvel (Eds.), 16th IEEE International Enterprise Distributed Object Computing Conference, EDOC 2012, Beijing, China, September 10-14, 2012, IEEE, New York, 2012, pp. 41–50, URL 〈 http://dx.doi.org/10.1109/EDOC.2012.15〉.
    • Burattin, A.1    Maggi, F.M.2    Van der Aalst, W.M.P.3    Sperduti, A.4
  • 21
    • 84887001939 scopus 로고    scopus 로고
    • Heuristics miner for time intervals
    • Bruges, Belgium, April 28-30, 2010, Proceedings, URL 〈〉
    • [21] A. Burattin, A. Sperduti, Heuristics miner for time intervals, in: ESANN 2010, 18th European Symposium on Artificial Neural Networks, Bruges, Belgium, April 28–30, 2010, Proceedings, 2010, URL 〈 https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2010-105.pdf〉.
    • (2010) in: ESANN 2010, 18th European Symposium on Artificial Neural Networks
    • Burattin, A.1    Sperduti, A.2
  • 23
    • 76249104125 scopus 로고    scopus 로고
    • Declarative specification and verification of service choreographiess
    • 4 (1), URL 〈〉
    • [23] M. Montali, M. Pesic, W.M.P. van der Aalst, F. Chesani, P. Mello, S. Storari, Declarative specification and verification of service choreographiess, TWEB 4 (1), URL 〈 http://dx.doi.org/10.1145/1658373.1658376〉.
    • TWEB
    • Montali, M.1    Pesic, M.2    Van der Aalst, W.M.P.3    Chesani, F.4    Mello, P.5    Storari, S.6
  • 24
    • 67349232819 scopus 로고    scopus 로고
    • Declarative workflows: balancing between flexibility and support
    • [24] van der Aalst, W.M.P., Pesic, M., Schonenberg, H., Declarative workflows: balancing between flexibility and support. Comput. Sci.—R&D 23:2 (2009), 99–113, 10.1007/s00450-009-0057-9.
    • (2009) Comput. Sci.—R&D , vol.23 , Issue.2 , pp. 99-113
    • van der Aalst, W.M.P.1    Pesic, M.2    Schonenberg, H.3
  • 25
    • 84896693498 scopus 로고    scopus 로고
    • Vacuity detection in temporal model checking
    • [25] Kupferman, O., Vardi, M.Y., Vacuity detection in temporal model checking. STTT 4:2 (2003), 224–233, 10.1007/s100090100062.
    • (2003) STTT , vol.4 , Issue.2 , pp. 224-233
    • Kupferman, O.1    Vardi, M.Y.2
  • 27
    • 84977107929 scopus 로고    scopus 로고
    • in: XES Standard Definition, Link 〈http://www.xes-standard.org/_media/xes/xes_standard_proposal.pdf〉
    • [27] C.W. Günther, in: XES Standard Definition, www.xes-standard.org 2009, Link 〈 http://www.xes-standard.org/_media/xes/xes_standard_proposal.pdf〉.
    • (2009)
    • Günther, C.W.1
  • 28
    • 79953841371 scopus 로고    scopus 로고
    • Lucia, Mining closed discriminative dyadic sequential patterns
    • Uppsala, Sweden, March 21–24, 2011, Proceedings, URL 〈〉
    • [28] D. Lo, H. Cheng, Lucia, Mining closed discriminative dyadic sequential patterns, in: EDBT 2011, 14th International Conference on Extending Database Technology, Uppsala, Sweden, March 21–24, 2011, Proceedings, 2011, pp. 21–32, URL 〈 http://doi.acm.org/10.1145/1951365.1951371〉.
    • (2011) in: EDBT 2011, 14th International Conference on Extending Database Technology , pp. 21-32
    • Lo, D.1    Cheng, H.2
  • 31
    • 78149313084 scopus 로고    scopus 로고
    • Cmar: accurate and efficient classification based on multiple class-association rules
    • 2001, ICDM 2001,, URL 〈〉
    • [31] W. Li, J. Han, J. Pei, Cmar: accurate and efficient classification based on multiple class-association rules, in: Proceedings IEEE International Conference on Data Mining, 2001, ICDM 2001, 2001, pp. 369–376, URL 〈 http://dx.doi.org/10.1109/ICDM.2001.989541〉.
    • (2001) in: Proceedings IEEE International Conference on Data Mining , pp. 369-376
    • Li, W.1    Han, J.2    Pei, J.3
  • 33
    • 0003922190 scopus 로고    scopus 로고
    • Pattern Classification
    • 2nd ed. Wiley-Interscience New York
    • [33] Duda, R.O., Hart, P.E., Stork, D.G., Pattern Classification. 2nd ed., 2000, Wiley-Interscience, New York.
    • (2000)
    • Duda, R.O.1    Hart, P.E.2    Stork, D.G.3
  • 34
    • 0003500248 scopus 로고
    • C4.5: Programs for Machine Learning
    • Morgan Kaufmann Publishers Inc., San Francisco CA, USA
    • [34] Quinlan, J.R., C4.5: Programs for Machine Learning. 1993, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
    • (1993)
    • Quinlan, J.R.1
  • 35
    • 37149034176 scopus 로고    scopus 로고
    • Correlation patterns in service-oriented architectures
    • FASE 2007, Held as Part of the Joint European Conferences, on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24–April 1, 2007, Proceedings, URL 〈〉
    • [35] A.P. Barros, G. Decker, M. Dumas, F. Weber, Correlation patterns in service-oriented architectures, in: Fundamental Approaches to Software Engineering, 10th International Conference, FASE 2007, Held as Part of the Joint European Conferences, on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24–April 1, 2007, Proceedings, 2007, pp. 245–259, URL 〈 http://dx.doi.org/10.1007/978-3-540-71289-3_20〉.
    • (2007) in: Fundamental Approaches to Software Engineering, 10th International Conference , pp. 245-259
    • Barros, A.P.1    Decker, G.2    Dumas, M.3    Weber, F.4
  • 37
    • 84886732108 scopus 로고    scopus 로고
    • Bpi Challenge 2013, Incidents, , URL 〈http://dx.doi.org/10.4121/uuid:500573e6-accc-4b0c-9576-aa5468b10cee〉
    • [37] W. Steeman, Bpi Challenge 2013, Incidents, 2013, http://dx.doi.org/10.4121/uuid:500573e6-accc-4b0c-9576-aa5468b10cee URL 〈 http://dx.doi.org/10.4121/uuid:500573e6-accc-4b0c-9576-aa5468b10cee〉.
    • (2013)
    • Steeman, W.1
  • 38
    • 38049153327 scopus 로고    scopus 로고
    • Multi-phase process mining: aggregating instance graphs into EPCs and Petri Nets
    • in: PNCWB 2005 Workshop, URL 〈〉
    • [38] B. van Dongen, W.M.P. van der Aalst, Multi-phase process mining: aggregating instance graphs into EPCs and Petri Nets, in: PNCWB 2005 Workshop, 2005, pp. 35–58, URL 〈 http://dx.doi.org/10.1.1.117.6183〉.
    • (2005) , pp. 35-58
    • Van Dongen, B.1    Van der Aalst, W.2
  • 39
    • 84890470685 scopus 로고    scopus 로고
    • Mining process models from workflow logs
    • in: H.-J. Schek, G. Alonso, F. Saltor, I. Ramos (Eds.), Advances in Database Technology—EDBT’98, Lecture Notes in Computer Science, vol. 1377, Springer, Berlin, Heidelberg, 10.1007/BFb0101003. URL 〈〉
    • [39] R. Agrawal, D. Gunopulos, F. Leymann, Mining process models from workflow logs, in: H.-J. Schek, G. Alonso, F. Saltor, I. Ramos (Eds.), Advances in Database Technology—EDBT’98, Lecture Notes in Computer Science, vol. 1377, Springer, Berlin, Heidelberg, 1998, pp. 467–483, 10.1007/BFb0101003. URL 〈 http://dx.doi.org/10.1007/BFb0101003〉.
    • (1998) , pp. 467-483
    • Agrawal, R.1    Gunopulos, D.2    Leymann, F.3
  • 40
    • 4544353101 scopus 로고    scopus 로고
    • Workflow mining: discovering process models from event logs
    • URL 〈〉
    • [40] van der Aalst, W.M.P., Weijters, T., Maruster, L., Workflow mining: discovering process models from event logs. IEEE Trans. Knowl. Data Eng. 16:9 (2004), 1128–1142 URL 〈 http://csdl.computer.org/comp/trans/tk/2004/09/k1143abs.htm〉.
    • (2004) IEEE Trans. Knowl. Data Eng. , vol.16 , Issue.9 , pp. 1128-1142
    • van der Aalst, W.M.P.1    Weijters, T.2    Maruster, L.3
  • 41
    • 84883435609 scopus 로고    scopus 로고
    • Mining process models with non-free-choice constructs
    • [41] Wen, L., van der Aalst, W.M.P., Wang, J., Sun, J., Mining process models with non-free-choice constructs. Data Min. Knowl. Discov. 15:2 (2007), 145–180, 10.1007/s10618-007-0065-y.
    • (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
  • 42
    • 0038002768 scopus 로고    scopus 로고
    • Rediscovering workflow models from event-based data using little thumb
    • URL 〈〉
    • [42] Weijters, A.J.M.M., van der Aalst, W.M.P., Rediscovering workflow models from event-based data using little thumb. Integr. Comput. Aided Eng. 10:2 (2003), 151–162 URL 〈 http://iospress.metapress.com/content/8puq22eumrva7vyp/〉.
    • (2003) Integr. Comput. Aided Eng. , vol.10 , Issue.2 , pp. 151-162
    • Weijters, A.J.M.M.1    van der Aalst, W.M.P.2
  • 45
    • 84966542521 scopus 로고    scopus 로고
    • Knowledge-intensive processes: characteristics, requirements and analysis of contemporary approaches
    • [45] Di Ciccio, C., Marrella, A., Russo, A., Knowledge-intensive processes: characteristics, requirements and analysis of contemporary approaches. J. Data Semant. 4:1 (2015), 29–57, 10.1007/s13740-014-0038-4.
    • (2015) J. Data Semant. , vol.4 , Issue.1 , pp. 29-57
    • Di Ciccio, C.1    Marrella, A.2    Russo, A.3
  • 46
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • J.B. Bocca M. Jarke C. Zaniolo Morgan Kaufmann Publishers Inc. San Francisco, CA, USA URL 〈〉
    • [46] Agrawal, R., Srikant, R., Fast algorithms for mining association rules in large databases. Bocca, J.B., Jarke, M., Zaniolo, C., (eds.) VLDB, 1994, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 487–499 URL 〈 http://www.vldb.org/conf/1994/P487.PDF〉.
    • (1994) VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 47
    • 51149086600 scopus 로고    scopus 로고
    • Verifiable agent interaction in abductive logic programming: the Schiff framework
    • 29:1–29:43
    • [47] Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P., Verifiable agent interaction in abductive logic programming: the Schiff framework. ACM Trans. Comput. Log., 9(4), 2008, 10.1145/1380572.1380578 29:1–29:43.
    • (2008) ACM Trans. Comput. Log. , vol.9 , Issue.4
    • Alberti, M.1    Chesani, F.2    Gavanelli, M.3    Lamma, E.4    Mello, P.5    Torroni, P.6
  • 48
    • 32044466073 scopus 로고    scopus 로고
    • Markov logic networks
    • [48] Richardson, M., Domingos, P., Markov logic networks. Mach. Learn. 62:1–2 (2006), 107–136, 10.1007/s10994-006-5833-1.
    • (2006) Mach. Learn. , vol.62 , Issue.1-2 , pp. 107-136
    • Richardson, M.1    Domingos, P.2
  • 49
    • 84919622373 scopus 로고    scopus 로고
    • Discovering metric temporal business constraints from event logs
    • BIR 2014, Lund, Sweden, September 22–24, 2014. Proceedings, URL 〈〉
    • [49] F.M. Maggi, Discovering metric temporal business constraints from event logs, in: Perspectives in Business Informatics Research—13th International Conference, BIR 2014, Lund, Sweden, September 22–24, 2014. Proceedings, 2014, pp. 261–275, URL 〈 http://dx.doi.org/10.1007/978-3-319-11370-8_19〉.
    • (2014) in: Perspectives in Business Informatics Research—13th International Conference , pp. 261-275
    • Maggi, F.M.1
  • 50
    • 84891781134 scopus 로고    scopus 로고
    • Monitoring business constraints with the event calculus
    • [50] Montali, M., Maggi, F.M., Chesani, F., Mello, P., van der Aalst, W.M.P., Monitoring business constraints with the event calculus. ACM TIST, 5(1), 2013, 17, 10.1145/2542182.2542199.
    • (2013) ACM TIST , vol.5 , Issue.1 , pp. 17
    • Montali, M.1    Maggi, F.M.2    Chesani, F.3    Mello, P.4    van der Aalst, W.M.P.5
  • 51
    • 67649967197 scopus 로고    scopus 로고
    • Verification of choreographies during execution using the reactive event calculus
    • [51] F. Chesani, P. Mello, M. Montali, P. Torroni, Verification of choreographies during execution using the reactive event calculus, in: WS-FM, 2008, pp. 55–72.
    • (2008) in: WS-FM , pp. 55-72
    • Chesani, F.1    Mello, P.2    Montali, M.3    Torroni, P.4
  • 52
    • 84902494191 scopus 로고    scopus 로고
    • Monitoring data-aware business constraints with finite state automata
    • , ICSSP ׳14, Nanjing, China, May 26–28, URL 〈〉
    • [52] R. De Masellis, F. M. Maggi, M. Montali, Monitoring data-aware business constraints with finite state automata, in: International Conference on Software and Systems Process 2014, ICSSP ׳14, Nanjing, China, May 26–28, 2014, pp. 134–143, URL 〈 http://dx.doi.org/10.1145/2600821.2600835〉.
    • (2014) in: International Conference on Software and Systems Process 2014 , pp. 134-143
    • De Masellis, R.1    Maggi, F.M.2    Montali, M.3
  • 56
    • 0016919826 scopus 로고
    • Newton–Raphson and related algorithms for maximum likelihood variance component estimation
    • URL 〈〉
    • [56] Jennrich, R.I., Sampson, P.F., Newton–Raphson and related algorithms for maximum likelihood variance component estimation. Technometrics 18:1 (1976), 11–17 URL 〈 http://www.jstor.org/stable/1267911〉.
    • (1976) Technometrics , vol.18 , Issue.1 , pp. 11-17
    • Jennrich, R.I.1    Sampson, P.F.2
  • 57
    • 84925060988 scopus 로고    scopus 로고
    • Discovering cross-organizational business rules from the cloud
    • CIDM 2014, Orlando, FL, USA, 9-12 December 2014, IEEE, New York, 〈.〉
    • [57] Mario Luca Bernardi, Marta Cimitile, Fabrizio Maria Magg, Discovering cross-organizational business rules from the cloud, in: 2014 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2014, Orlando, FL, USA, 9-12 December 2014, IEEE, New York, 2014, pp. 389–396, 〈 http://dx.doi.org/10.1109/CIDM.2014.7008694.〉.
    • (2014) in: 2014 IEEE Symposium on Computational Intelligence and Data Mining , pp. 389-396
    • Bernardi, M.L.1    Cimitile, M.2    Magg, F.M.3


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