An experimental evaluation of passage-based process discovery

H.M.W. Verbeek; W.M.P. Aalst, van der

doi:10.1007/978-3-642-36285-9_21

An experimental evaluation of passage-based process discovery

H.M.W. Verbeek
, W.M.P. Aalst, van der

Process Analytics

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

6 Citaten (Scopus)

Samenvatting

In the area of process mining, the ILP Miner is known for the fact that it always returns a Petri net that perfectly fits a given event log. Like for most process discovery algorithms, its complexity is linear in the size of the event log and exponential in the number of event classes (i.e., distinct activities). As a result, the potential gain by partitioning the event classes is much higher than the potential gain by partitioning the traces in the event log over multiple event logs. This paper proposes to use the so-called passages to split up the event classes over multiple event logs, and shows the results are for seven large real-life event logs and one artificial event log: The use of passages indeed alleviates the complexity, but much hinges on the size of the largest passage detected.

Originele taal-2	Engels
Titel	Business Process Management Workshops : BPM 2012 International Workshops, Tallinn, Estonia, September 3, 2012. Revised Papers
Redacteuren	M. La Rosa, P. Soffer
Plaats van productie	Berlin
Uitgeverij	Springer
Pagina's	205-210
ISBN van geprinte versie	978-3-642-36284-2
DOI's	https://doi.org/10.1007/978-3-642-36285-9_21
Status	Gepubliceerd - 2013
Evenement	8th International Workshop on Business Process Intelligence (BPI 2012) - Tallinn, Estland Duur: 3 sep 2012 → 3 sep 2012 Congresnummer: 8

Publicatie series

Naam	Lecture Notes in Business Information Processing
Volume	132
ISSN van geprinte versie	1865-1348

Workshop

Workshop	8th International Workshop on Business Process Intelligence (BPI 2012)
Verkorte titel	BPI 2012
Land/Regio	Estland
Stad	Tallinn
Periode	3/09/12 → 3/09/12
Ander	BPM 2012

Toegang tot document

10.1007/978-3-642-36285-9_21

Citeer dit

Verbeek, H. M. W., & Aalst, van der, W. M. P. (2013). An experimental evaluation of passage-based process discovery. In M. La Rosa, & P. Soffer (editors), Business Process Management Workshops : BPM 2012 International Workshops, Tallinn, Estonia, September 3, 2012. Revised Papers (blz. 205-210). (Lecture Notes in Business Information Processing; Vol. 132). Springer. https://doi.org/10.1007/978-3-642-36285-9_21

@inproceedings{68efb6ad8cfd465483ee5e27d9f65f7b,

title = "An experimental evaluation of passage-based process discovery",

abstract = "In the area of process mining, the ILP Miner is known for the fact that it always returns a Petri net that perfectly fits a given event log. Like for most process discovery algorithms, its complexity is linear in the size of the event log and exponential in the number of event classes (i.e., distinct activities). As a result, the potential gain by partitioning the event classes is much higher than the potential gain by partitioning the traces in the event log over multiple event logs. This paper proposes to use the so-called passages to split up the event classes over multiple event logs, and shows the results are for seven large real-life event logs and one artificial event log: The use of passages indeed alleviates the complexity, but much hinges on the size of the largest passage detected.",

author = "H.M.W. Verbeek and \{Aalst, van der\}, W.M.P.",

year = "2013",

doi = "10.1007/978-3-642-36285-9\_21",

language = "English",

isbn = "978-3-642-36284-2",

series = "Lecture Notes in Business Information Processing",

publisher = "Springer",

pages = "205--210",

editor = "\{La Rosa\}, M. and P. Soffer",

booktitle = "Business Process Management Workshops : BPM 2012 International Workshops, Tallinn, Estonia, September 3, 2012. Revised Papers",

address = "Germany",

note = "8th International Workshop on Business Process Intelligence (BPI 2012), BPI 2012 ; Conference date: 03-09-2012 Through 03-09-2012",

}

Verbeek, HMW & Aalst, van der, WMP 2013, An experimental evaluation of passage-based process discovery. in M La Rosa & P Soffer (reds.), Business Process Management Workshops : BPM 2012 International Workshops, Tallinn, Estonia, September 3, 2012. Revised Papers. Lecture Notes in Business Information Processing, vol. 132, Springer, Berlin, blz. 205-210, 8th International Workshop on Business Process Intelligence (BPI 2012), Tallinn, Estland, 3/09/12. https://doi.org/10.1007/978-3-642-36285-9_21

An experimental evaluation of passage-based process discovery. / Verbeek, H.M.W.; Aalst, van der, W.M.P.
Business Process Management Workshops : BPM 2012 International Workshops, Tallinn, Estonia, September 3, 2012. Revised Papers. reds. / M. La Rosa; P. Soffer. Berlin: Springer, 2013. blz. 205-210 (Lecture Notes in Business Information Processing; Vol. 132).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

TY - GEN

T1 - An experimental evaluation of passage-based process discovery

AU - Verbeek, H.M.W.

AU - Aalst, van der, W.M.P.

N1 - Conference code: 8

PY - 2013

Y1 - 2013

N2 - In the area of process mining, the ILP Miner is known for the fact that it always returns a Petri net that perfectly fits a given event log. Like for most process discovery algorithms, its complexity is linear in the size of the event log and exponential in the number of event classes (i.e., distinct activities). As a result, the potential gain by partitioning the event classes is much higher than the potential gain by partitioning the traces in the event log over multiple event logs. This paper proposes to use the so-called passages to split up the event classes over multiple event logs, and shows the results are for seven large real-life event logs and one artificial event log: The use of passages indeed alleviates the complexity, but much hinges on the size of the largest passage detected.

AB - In the area of process mining, the ILP Miner is known for the fact that it always returns a Petri net that perfectly fits a given event log. Like for most process discovery algorithms, its complexity is linear in the size of the event log and exponential in the number of event classes (i.e., distinct activities). As a result, the potential gain by partitioning the event classes is much higher than the potential gain by partitioning the traces in the event log over multiple event logs. This paper proposes to use the so-called passages to split up the event classes over multiple event logs, and shows the results are for seven large real-life event logs and one artificial event log: The use of passages indeed alleviates the complexity, but much hinges on the size of the largest passage detected.

U2 - 10.1007/978-3-642-36285-9_21

DO - 10.1007/978-3-642-36285-9_21

M3 - Conference contribution

SN - 978-3-642-36284-2

T3 - Lecture Notes in Business Information Processing

SP - 205

EP - 210

BT - Business Process Management Workshops : BPM 2012 International Workshops, Tallinn, Estonia, September 3, 2012. Revised Papers

A2 - La Rosa, M.

A2 - Soffer, P.

PB - Springer

CY - Berlin

T2 - 8th International Workshop on Business Process Intelligence (BPI 2012)

Y2 - 3 September 2012 through 3 September 2012

ER -

Verbeek HMW, Aalst, van der WMP. An experimental evaluation of passage-based process discovery. In La Rosa M, Soffer P, redacteurs, Business Process Management Workshops : BPM 2012 International Workshops, Tallinn, Estonia, September 3, 2012. Revised Papers. Berlin: Springer. 2013. blz. 205-210. (Lecture Notes in Business Information Processing). doi: 10.1007/978-3-642-36285-9_21

An experimental evaluation of passage-based process discovery

Samenvatting

Publicatie series

Workshop

Toegang tot document

Vingerafdruk

Citeer dit