Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/ADA7D9A5-04FB-444E-8833-FAFA15192C58 | - |
| Αναγνωριστικό | https://doi.org/10.1111/itor.13062 | - |
| Αναγνωριστικό | https://onlinelibrary.wiley.com/doi/10.1111/itor.13062 | - |
| Γλώσσα | en | - |
| Μέγεθος | 20 pages | en |
| Τίτλος | Improving the non-compensatory trace-clustering decision process | en |
| Δημιουργός | Delias Pavlos | en |
| Δημιουργός | Δελιας Παυλος | el |
| Δημιουργός | Doumpos Michail | en |
| Δημιουργός | Δουμπος Μιχαηλ | el |
| Δημιουργός | Grigoroudis Evangelos | en |
| Δημιουργός | Γρηγορουδης Ευαγγελος | el |
| Δημιουργός | Matsatsinis Nikolaos | en |
| Δημιουργός | Ματσατσινης Νικολαος | el |
| Εκδότης | Wiley | en |
| Περίληψη | In flexible environments (such as healthcare or customer service), the observed behavior is expected to considerably vary, namely there is no dominant flow path. Such a high variability obstructs the process discovery task since it regularly leads to “spaghetti” process models. Trace clustering is about grouping behaviors, and discovering a distinct model per group, thus delivering more comprehensible results. In previous works, we have proposed a multiple-criteria non-compensatory approach to create a similarity metric and finally perform trace clustering. The main problem that we tried to respond to is how to summarize a process event log, when a lot of variability exists, thus facilitating knowledge discovery. The underpinnings of the non-compensatory approach are first the fact that a sufficient number of criteria must be concordant with the similarity (concordance setting) and second that there should not exist any criterion raising a veto logic, that is, among the criteria that are not concordant, none of them must be conflicting with the similarity (discordance setting). This work challenges improved support for the decision-maker (DM) and it extends the previous approach by (i) proposing an improved clustering technique based on spectral clustering; (ii) guiding the clustering process by allowing reinforced or counterveto effects and pairwise constraints; (iii) handling outliers through a trimming approach as an integer linear program. All improvements aiming at making elements of the trace-clustering process more accessible to the DMs and enhancing the understandability of the analysis. | en |
| Τύπος | Peer-Reviewed Journal Publication | en |
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | el |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2022-10-03 | - |
| Ημερομηνία Δημοσίευσης | 2021 | - |
| Θεματική Κατηγορία | Process mining | en |
| Θεματική Κατηγορία | Trace clustering | en |
| Θεματική Κατηγορία | Outranking methods | en |
| Θεματική Κατηγορία | Robustness | en |
| Βιβλιογραφική Αναφορά | P. Delias, M. Doumpos, E. Grigoroudis, and N. Matsatsinis, “Improving the non‐compensatory trace‐clustering decision process,” Intl. Trans. in Op. Res., early access, doi: 10.1111/itor.13062. | en |
Copyright © DIAS 2013
