Mostra el registre d'ítem simple

dc.contributor.authorTaymouri, Farbod
dc.contributor.authorCarmona Vargas, Josep
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2019-01-17T14:55:18Z
dc.date.available2019-01-17T14:55:18Z
dc.date.issued2018
dc.identifier.citationTaymouri, F., Carmona, J. An evolutionary technique to approximate multiple optimal alignments. A: International Conference on Business Process Management. "Business Process Management,16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9-14, 2018: proceedings". Berlín: Springer, 2018, p. 215-232.
dc.identifier.isbn978-3-319-98648-7
dc.identifier.urihttp://hdl.handle.net/2117/127144
dc.description.abstractThe alignment of observed and modeled behavior is an essential aid for organizations, since it opens the door for root-cause analysis and enhancement of processes. The state-of-the-art technique for computing alignments has exponential time and space complexity, hindering its applicability for medium and large instances. Moreover, the fact that there may be multiple optimal alignments is perceived as a negative situation, while in reality it may provide a more comprehensive picture of the model’s explanation of observed behavior, from which other techniques may benefit. This paper presents a novel evolutionary technique for approximating multiple optimal alignments. Remarkably, the memory footprint of the proposed technique is bounded, representing an unprecedented guarantee with respect to the state-of-the-art methods for the same task. The technique is implemented into a tool, and experiments on several benchmarks are provided.
dc.format.extent18 p.
dc.language.isoeng
dc.publisherSpringer
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.lcshEvolutionary computation
dc.subject.lcshComputational complexity
dc.subject.lcshApproximation theory
dc.titleAn evolutionary technique to approximate multiple optimal alignments
dc.typeConference report
dc.subject.lemacComputació evolutiva
dc.subject.lemacComplexitat computacional
dc.subject.lemacAproximació, Teoria de l'
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1007/978-3-319-98648-7_13
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://link.springer.com/chapter/10.1007/978-3-319-98648-7_13
dc.rights.accessOpen Access
local.identifier.drac23568103
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/TIN2017-86727-C2-1-R/ES/MODELOS Y METODOS BASADOS EN GRAFOS PARA LA COMPUTACION EN GRAN ESCALA/
local.citation.authorTaymouri, F.; Carmona, J.
local.citation.contributorInternational Conference on Business Process Management
local.citation.pubplaceBerlín
local.citation.publicationNameBusiness Process Management,16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9-14, 2018: proceedings
local.citation.startingPage215
local.citation.endingPage232


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple