Trace retrieval for business process operational support

被引:7
作者
Bottrighi, Alessio [1 ]
Canensi, Luca [2 ]
Leonardi, Giorgio [1 ]
Montani, Stefania [1 ]
Terenziani, Paolo [1 ]
机构
[1] Univ Piemonte Orientate, Inst Comp Sci, DISIT, Alessandria, Italy
[2] Univ Turin, Dept Comp Sci, I-10124 Turin, Italy
关键词
Trace retrieval; Case based reasoning; Operational support; REGULAR EXPRESSIONS; SYSTEM;
D O I
10.1016/j.eswa.2015.12.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Operational support assists users while process instances are being executed, by making predictions about the instance completion, or recommending suitable actions, resources or routing decisions, on the basis of the already completed instances, stored as execution traces in the event log. In this paper, we propose a case-based retrieval approach to business process management operational support, where log traces are exploited as cases. Once past traces have been retrieved, classical statistical techniques can be applied to them, to support prediction and recommendation. The framework enables the user to submit queries able to express complex patterns exhibited by the current process instance. Such queries can be composed by several simple patterns (i.e., single actions, or direct sequences of actions), separated by delays (i.e., actions we do not care about). Delays can also be imprecise (i.e., the number of actions can be given as a range). The tool also relies on a tree structure, adopted as an index for a quick retrieval from the available event log. Our approach is highly innovative with respect to the existing literature panorama, since it is the first work that exploits case-based retrieval techniques in the operational support context; moreover, the possibility of retrieving traces by querying complex patterns and the indexing strategy are major departures also with respect to other existing trace retrieval tools proposed in the case based reasoning area. Thanks to its characteristics and methodological solutions, the tool implements operational support tasks in a flexible and efficient way, as demonstrated by our experimental results. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:212 / 221
页数:10
相关论文
共 37 条
  • [1] AAMODT A, 1994, AI COMMUN, V7, P39
  • [2] Context-Aware Recommender Systems
    Adomavicius, Gediminas
    Mobasher, Bamshad
    Ricci, Francesco
    Tuzhilin, Alex
    [J]. AI MAGAZINE, 2011, 32 (03) : 67 - 80
  • [3] Fast text searching for regular expressions or automaton searching on tries
    BaezaYates, RA
    Gonnet, GH
    [J]. JOURNAL OF THE ACM, 1996, 43 (06) : 915 - 936
  • [4] Similarity assessment and efficient retrieval of semantic workflows
    Bergmann, Ralph
    Gil, Yolanda
    [J]. INFORMATION SYSTEMS, 2014, 40 : 115 - 127
  • [5] FROM REGULAR EXPRESSIONS TO DETERMINISTIC AUTOMATA
    BERRY, G
    SETHI, R
    [J]. THEORETICAL COMPUTER SCIENCE, 1986, 48 (01) : 117 - 126
  • [6] Buijs J.C.A.M., 2012, On the Move to Meaningful Internet Systems: OTM 2012, P305, DOI DOI 10.1007/978-3-642-33606-5_19
  • [7] Canensi L., 2014, P WORKSH SYN CAS BAS
  • [8] Cordier A., 2013, P 26 INT FLOR ART IN
  • [9] Improving the quality of the Heuristics Miner in ProM 6.2
    De Cnudde, Sofie
    Claes, Jan
    Poels, Geert
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (17) : 7678 - 7690
  • [10] Dijkman R, 2009, LECT NOTES COMPUT SC, V5701, P48, DOI 10.1007/978-3-642-03848-8_5