Mostra el registre d'ítem simple

dc.contributor.authorSolé Simó, Marc
dc.contributor.authorCarmona Vargas, Josep
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-10-31T14:48:38Z
dc.date.available2016-10-31T14:48:38Z
dc.date.issued2012
dc.identifier.citationSolé, M., Carmona, J. "Amending C-net discovery algorithms". 2012.
dc.identifier.urihttp://hdl.handle.net/2117/91288
dc.description.abstractAs the complexity of information systems evolves, there is a growing interest in defining suitable process models than can overcome the limitations of traditional formalisms like Petri nets or related. Causal nets may be one of such promising process models, since important characteristics of their semantics deviate from the ones in the literature. Due to their novelty, very few discovery algorithms exist for Causal nets. Moreover, the existing ones offer very few guarantees regarding the outcome produced. This paper describes an algorithm that can be applied as a second step to any discovery technique to significantly improve the quality of the final Causal net derived. We have tested the technique in combination with the existing algorithms in the literature on several benchmarks, noticing a considerable improvement in all of them.
dc.format.extent18 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-12-6-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Sistemes d'informació
dc.subject.otherProcess mining
dc.subject.otherFormal methods
dc.titleAmending C-net discovery algorithms
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
local.identifier.drac19240603
dc.description.versionPostprint (published version)
local.citation.authorSolé, M.; Carmona, J.


Fitxers d'aquest items

Thumbnail

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

Mostra el registre d'ítem simple