Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E | ||
| Year | 2017 | ||
| Type of Item | Peer-Reviewed Journal Publication | ||
| License |
|
||
| Bibliographic Citation | P. Delias, M. Doumpos, E. Grigoroudis and N. Matsatsinis, "A non-compensatory approach for trace clustering," Int. T. Oper. Res., Feb. 2017. doi: 10.1111/itor.12395 https://doi.org/10.1111/itor.12395 | ||
| Appears in Collections |
One of the main functions of process mining is the automated discovery of process models from event log files. However, in flexible environments, such as healthcare or customer service, delivering comprehensible process models can be very challenging, mainly due to the complexity of the registered logs. A prevalent response to this problem is trace clustering, that is, grouping behaviors and discovering a distinct model per group. In this paper, we propose a novel trace clustering technique inspired from the outranking relations theory. The proposed technique can handle multiple criteria with strongly heterogeneous scales, and it allows a non-compensatory logic to guide the creation of a similarity metric. To reach this, we use three key components: We separate factors that are in favor of the similarity from those that are not, through discrimination thresholds; we provide non-concordant factors with a "veto" power; and we aggregate all factors into an overall metric. We evaluated this novel, non-compensatory approach against two of the most spotlighted trace clustering functions: variants' identification and model complexity reduction. Results suggest that the proposed technique can be used at both functions with compelling performance.
Copyright © DIAS 2013
