<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E"><efrbr-work:titleOfTheWork>A non-compensatory approach for trace clustering</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E"><efrbr-expression:titleOfTheExpression>A non-compensatory approach for trace clustering</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2018-06-21</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2017</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>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.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="journal name">International Transactions in Operational Research</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~pdelias"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Delias Pavlos
            Δελιας Παυλος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~mdoubos"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Doumpos Michael
            Δουμπος Μιχαηλ
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~egrigoroudis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Grigoroudis Evangelos
            Γρηγορουδης Ευαγγελος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~nmatsatsinis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Matsatsinis Nikolaos
            Ματσατσινης Νικολαος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="F7CFE351-F9BA-4D5F-97AC-DB86DB99D92F"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="">
            The International Federation of Operational Research Societies
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="650AC681-BF40-437D-88DA-E1C097C4913C"><efrbr-concept:termForTheConcept>
            Multiple criteria decision aid
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="9F3D9650-F56C-41AD-B509-38C91703B741"><efrbr-concept:termForTheConcept>
            Process mining
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="7E3C1128-AD69-4416-99A6-8474267246FE"><efrbr-concept:termForTheConcept>
            Trace clustering
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E" targetURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E" targetURI="http://users.isc.tuc.gr/~pdelias"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E" targetURI="http://users.isc.tuc.gr/~pdelias"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E" targetURI="http://users.isc.tuc.gr/~mdoubos"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E" targetURI="http://users.isc.tuc.gr/~egrigoroudis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E" targetURI="http://users.isc.tuc.gr/~nmatsatsinis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E" targetURI="F7CFE351-F9BA-4D5F-97AC-DB86DB99D92F"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E" targetURI="650AC681-BF40-437D-88DA-E1C097C4913C"/><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E" targetURI="9F3D9650-F56C-41AD-B509-38C91703B741"/><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/E8A54329-CA15-466B-8D4A-F5C3907A8C2E" targetURI="7E3C1128-AD69-4416-99A6-8474267246FE"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>