{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T08:30:18Z","timestamp":1690446618690},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2018,11]]},"abstract":"<jats:p> Process Discovery techniques, allowing to extract graph-like models from large process logs, are a valuable mean for grasping a summarized view of real business processes\u2019 behaviors. If augmented with statistics on process performances (e.g., processing times), such models help study the evolution of process performances across different processing steps, and possibly detect bottlenecks and worst practices. However, when the process analyzed exhibits complex and heterogeneous behaviors, these techniques fail to yield good quality models, in terms of readability, accuracy and generality. In particular, the presence of deviant traces may lead to cumbersome models and misleading performance statistics. Current noise\/outlier filtering solutions can alleviate this problem and help discover a better model for \u201cnormal\u201d process executions, but they do not provide insight on the deviant ones. Then, difficult and expensive analyses are usually performed to extract interpretable and general enough patterns for deviant behaviors. The performance-oriented discovery approach proposed here is addressed to recognize and describe both a normal execution scenario and deviant ones for the process analyzed, by inducing different sub-models: (i) a collection of readable clustering rules (conjunctive patterns over trace attributes) defining the deviance scenarios; (ii) a performance model [Formula: see text] for the \u201cnormal\u201d traces that do not fall in any deviant scenario; and (iii) a performance model (and a \u201cdifference\u201d model emphasizing the differences in behaviors from the \u201cnormal\u201d execution scenario), for each discovered deviance scenario. Technically, these models are discovered by exploiting a conceptual clustering method, embedded in an iterative optimization scheme where the current version of [Formula: see text] is replaced with the model extracted from the newly found normality cluster, in case the latter is more accurate than [Formula: see text]; on the other hand, the clustering procedure is devised to greedily find groups of traces that maximally deviate from [Formula: see text]. Tests on real-life logs confirmed the validity of this approach, and its capability to find good performance models, and to support the analysis of deviant process instances. <\/jats:p>","DOI":"10.1142\/s0218213018600096","type":"journal-article","created":{"date-parts":[[2018,11,14]],"date-time":"2018-11-14T08:15:52Z","timestamp":1542183352000},"page":"1860009","source":"Crossref","is-referenced-by-count":2,"title":["Deviance-Aware Discovery of High-Quality Process Models"],"prefix":"10.1142","volume":"27","author":[{"given":"Alfredo","family":"Cuzzocrea","sequence":"first","affiliation":[{"name":"DIA Department, University of Trieste, Trieste, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Folino","sequence":"additional","affiliation":[{"name":"ICAR Institute, National Research Council, Rende, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Guarascio","sequence":"additional","affiliation":[{"name":"ICAR Institute, National Research Council, Rende, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Pontieri","sequence":"additional","affiliation":[{"name":"ICAR Institute, National Research Council, Rende, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,11,14]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1045"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.09.001"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-023X(03)00066-1"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1144"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.04.004"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2614680"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1142\/S0218843017400032"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.64"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.07.002"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.123"},{"issue":"9","key":"p_27","first-page":"3113","volume":"7","author":"Hu H.","year":"2011","journal-title":"Journal of Computational Information Systems"},{"key":"p_32","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.09.002"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213018600096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:42:05Z","timestamp":1565098925000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213018600096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":12,"journal-issue":{"issue":"07","published-online":{"date-parts":[[2018,11,14]]},"published-print":{"date-parts":[[2018,11]]}},"alternative-id":["10.1142\/S0218213018600096"],"URL":"https:\/\/doi.org\/10.1142\/s0218213018600096","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11]]}}}