Impact-Driven Process Model Repair
The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process mod...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Polyvyanyy, Artem [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2017 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: ACM transactions on software engineering and methodology - New York, NY : ACM Press, 1992, 25(2017), 4, Seite 1-60 |
|---|---|
| Übergeordnetes Werk: |
volume:25 ; year:2017 ; number:4 ; pages:1-60 |
| Links: |
|---|
| DOI / URN: |
10.1145/2980764 |
|---|
| Katalog-ID: |
OLC1989261787 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1989261787 | ||
| 003 | DE-627 | ||
| 005 | 20220214154612.0 | ||
| 007 | tu | ||
| 008 | 170207s2017 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1145/2980764 |2 doi | |
| 028 | 5 | 2 | |a PQ20170501 |
| 035 | |a (DE-627)OLC1989261787 | ||
| 035 | |a (DE-599)GBVOLC1989261787 | ||
| 035 | |a (PRQ)a752-f451747947849e7de19bdcff16ee63a09a7acfe0d7eaf66eaf508a2e6913a7fa0 | ||
| 035 | |a (KEY)0202023820170000025000400001impactdrivenprocessmodelrepair | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q DNB |
| 084 | |a 54.00 |2 bkl | ||
| 100 | 1 | |a Polyvyanyy, Artem |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Impact-Driven Process Model Repair |
| 264 | 1 | |c 2017 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs. | ||
| 650 | 4 | |a process model | |
| 650 | 4 | |a event log | |
| 650 | 4 | |a Process mining | |
| 650 | 4 | |a process model repair | |
| 650 | 4 | |a repair recommendation | |
| 700 | 1 | |a Aalst, Wil |4 oth | |
| 700 | 1 | |a Hofstede, Arthur |4 oth | |
| 700 | 1 | |a Wynn, Moe |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t ACM transactions on software engineering and methodology |d New York, NY : ACM Press, 1992 |g 25(2017), 4, Seite 1-60 |w (DE-627)13105757X |w (DE-600)1105550-9 |w (DE-576)029156734 |x 1049-331X |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2017 |g number:4 |g pages:1-60 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1145/2980764 |3 Volltext |
| 856 | 4 | 2 | |u http://dl.acm.org/citation.cfm?id=2980764 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 936 | b | k | |a 54.00 |q AVZ |
| 951 | |a AR | ||
| 952 | |d 25 |j 2017 |e 4 |h 1-60 | ||
| author_variant |
a p ap |
|---|---|
| matchkey_str |
article:1049331X:2017----::matrvnrcsm |
| hierarchy_sort_str |
2017 |
| bklnumber |
54.00 |
| publishDate |
2017 |
| allfields |
10.1145/2980764 doi PQ20170501 (DE-627)OLC1989261787 (DE-599)GBVOLC1989261787 (PRQ)a752-f451747947849e7de19bdcff16ee63a09a7acfe0d7eaf66eaf508a2e6913a7fa0 (KEY)0202023820170000025000400001impactdrivenprocessmodelrepair DE-627 ger DE-627 rakwb eng 004 DNB 54.00 bkl Polyvyanyy, Artem verfasserin aut Impact-Driven Process Model Repair 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs. process model event log Process mining process model repair repair recommendation Aalst, Wil oth Hofstede, Arthur oth Wynn, Moe oth Enthalten in ACM transactions on software engineering and methodology New York, NY : ACM Press, 1992 25(2017), 4, Seite 1-60 (DE-627)13105757X (DE-600)1105550-9 (DE-576)029156734 1049-331X nnns volume:25 year:2017 number:4 pages:1-60 http://dx.doi.org/10.1145/2980764 Volltext http://dl.acm.org/citation.cfm?id=2980764 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 54.00 AVZ AR 25 2017 4 1-60 |
| spelling |
10.1145/2980764 doi PQ20170501 (DE-627)OLC1989261787 (DE-599)GBVOLC1989261787 (PRQ)a752-f451747947849e7de19bdcff16ee63a09a7acfe0d7eaf66eaf508a2e6913a7fa0 (KEY)0202023820170000025000400001impactdrivenprocessmodelrepair DE-627 ger DE-627 rakwb eng 004 DNB 54.00 bkl Polyvyanyy, Artem verfasserin aut Impact-Driven Process Model Repair 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs. process model event log Process mining process model repair repair recommendation Aalst, Wil oth Hofstede, Arthur oth Wynn, Moe oth Enthalten in ACM transactions on software engineering and methodology New York, NY : ACM Press, 1992 25(2017), 4, Seite 1-60 (DE-627)13105757X (DE-600)1105550-9 (DE-576)029156734 1049-331X nnns volume:25 year:2017 number:4 pages:1-60 http://dx.doi.org/10.1145/2980764 Volltext http://dl.acm.org/citation.cfm?id=2980764 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 54.00 AVZ AR 25 2017 4 1-60 |
| allfields_unstemmed |
10.1145/2980764 doi PQ20170501 (DE-627)OLC1989261787 (DE-599)GBVOLC1989261787 (PRQ)a752-f451747947849e7de19bdcff16ee63a09a7acfe0d7eaf66eaf508a2e6913a7fa0 (KEY)0202023820170000025000400001impactdrivenprocessmodelrepair DE-627 ger DE-627 rakwb eng 004 DNB 54.00 bkl Polyvyanyy, Artem verfasserin aut Impact-Driven Process Model Repair 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs. process model event log Process mining process model repair repair recommendation Aalst, Wil oth Hofstede, Arthur oth Wynn, Moe oth Enthalten in ACM transactions on software engineering and methodology New York, NY : ACM Press, 1992 25(2017), 4, Seite 1-60 (DE-627)13105757X (DE-600)1105550-9 (DE-576)029156734 1049-331X nnns volume:25 year:2017 number:4 pages:1-60 http://dx.doi.org/10.1145/2980764 Volltext http://dl.acm.org/citation.cfm?id=2980764 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 54.00 AVZ AR 25 2017 4 1-60 |
| allfieldsGer |
10.1145/2980764 doi PQ20170501 (DE-627)OLC1989261787 (DE-599)GBVOLC1989261787 (PRQ)a752-f451747947849e7de19bdcff16ee63a09a7acfe0d7eaf66eaf508a2e6913a7fa0 (KEY)0202023820170000025000400001impactdrivenprocessmodelrepair DE-627 ger DE-627 rakwb eng 004 DNB 54.00 bkl Polyvyanyy, Artem verfasserin aut Impact-Driven Process Model Repair 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs. process model event log Process mining process model repair repair recommendation Aalst, Wil oth Hofstede, Arthur oth Wynn, Moe oth Enthalten in ACM transactions on software engineering and methodology New York, NY : ACM Press, 1992 25(2017), 4, Seite 1-60 (DE-627)13105757X (DE-600)1105550-9 (DE-576)029156734 1049-331X nnns volume:25 year:2017 number:4 pages:1-60 http://dx.doi.org/10.1145/2980764 Volltext http://dl.acm.org/citation.cfm?id=2980764 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 54.00 AVZ AR 25 2017 4 1-60 |
| allfieldsSound |
10.1145/2980764 doi PQ20170501 (DE-627)OLC1989261787 (DE-599)GBVOLC1989261787 (PRQ)a752-f451747947849e7de19bdcff16ee63a09a7acfe0d7eaf66eaf508a2e6913a7fa0 (KEY)0202023820170000025000400001impactdrivenprocessmodelrepair DE-627 ger DE-627 rakwb eng 004 DNB 54.00 bkl Polyvyanyy, Artem verfasserin aut Impact-Driven Process Model Repair 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs. process model event log Process mining process model repair repair recommendation Aalst, Wil oth Hofstede, Arthur oth Wynn, Moe oth Enthalten in ACM transactions on software engineering and methodology New York, NY : ACM Press, 1992 25(2017), 4, Seite 1-60 (DE-627)13105757X (DE-600)1105550-9 (DE-576)029156734 1049-331X nnns volume:25 year:2017 number:4 pages:1-60 http://dx.doi.org/10.1145/2980764 Volltext http://dl.acm.org/citation.cfm?id=2980764 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 54.00 AVZ AR 25 2017 4 1-60 |
| language |
English |
| source |
Enthalten in ACM transactions on software engineering and methodology 25(2017), 4, Seite 1-60 volume:25 year:2017 number:4 pages:1-60 |
| sourceStr |
Enthalten in ACM transactions on software engineering and methodology 25(2017), 4, Seite 1-60 volume:25 year:2017 number:4 pages:1-60 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
process model event log Process mining process model repair repair recommendation |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
ACM transactions on software engineering and methodology |
| authorswithroles_txt_mv |
Polyvyanyy, Artem @@aut@@ Aalst, Wil @@oth@@ Hofstede, Arthur @@oth@@ Wynn, Moe @@oth@@ |
| publishDateDaySort_date |
2017-01-01T00:00:00Z |
| hierarchy_top_id |
13105757X |
| dewey-sort |
14 |
| id |
OLC1989261787 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1989261787</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220214154612.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">170207s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1145/2980764</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170501</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1989261787</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1989261787</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)a752-f451747947849e7de19bdcff16ee63a09a7acfe0d7eaf66eaf508a2e6913a7fa0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0202023820170000025000400001impactdrivenprocessmodelrepair</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Polyvyanyy, Artem</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Impact-Driven Process Model Repair</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">process model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">event log</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Process mining</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">process model repair</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">repair recommendation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Aalst, Wil</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hofstede, Arthur</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wynn, Moe</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">ACM transactions on software engineering and methodology</subfield><subfield code="d">New York, NY : ACM Press, 1992</subfield><subfield code="g">25(2017), 4, Seite 1-60</subfield><subfield code="w">(DE-627)13105757X</subfield><subfield code="w">(DE-600)1105550-9</subfield><subfield code="w">(DE-576)029156734</subfield><subfield code="x">1049-331X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:4</subfield><subfield code="g">pages:1-60</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1145/2980764</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://dl.acm.org/citation.cfm?id=2980764</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2017</subfield><subfield code="e">4</subfield><subfield code="h">1-60</subfield></datafield></record></collection>
|
| author |
Polyvyanyy, Artem |
| spellingShingle |
Polyvyanyy, Artem ddc 004 bkl 54.00 misc process model misc event log misc Process mining misc process model repair misc repair recommendation Impact-Driven Process Model Repair |
| authorStr |
Polyvyanyy, Artem |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)13105757X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1049-331X |
| topic_title |
004 DNB 54.00 bkl Impact-Driven Process Model Repair process model event log Process mining process model repair repair recommendation |
| topic |
ddc 004 bkl 54.00 misc process model misc event log misc Process mining misc process model repair misc repair recommendation |
| topic_unstemmed |
ddc 004 bkl 54.00 misc process model misc event log misc Process mining misc process model repair misc repair recommendation |
| topic_browse |
ddc 004 bkl 54.00 misc process model misc event log misc Process mining misc process model repair misc repair recommendation |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
w a wa a h ah m w mw |
| hierarchy_parent_title |
ACM transactions on software engineering and methodology |
| hierarchy_parent_id |
13105757X |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
ACM transactions on software engineering and methodology |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)13105757X (DE-600)1105550-9 (DE-576)029156734 |
| title |
Impact-Driven Process Model Repair |
| ctrlnum |
(DE-627)OLC1989261787 (DE-599)GBVOLC1989261787 (PRQ)a752-f451747947849e7de19bdcff16ee63a09a7acfe0d7eaf66eaf508a2e6913a7fa0 (KEY)0202023820170000025000400001impactdrivenprocessmodelrepair |
| title_full |
Impact-Driven Process Model Repair |
| author_sort |
Polyvyanyy, Artem |
| journal |
ACM transactions on software engineering and methodology |
| journalStr |
ACM transactions on software engineering and methodology |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2017 |
| contenttype_str_mv |
txt |
| container_start_page |
1 |
| author_browse |
Polyvyanyy, Artem |
| container_volume |
25 |
| class |
004 DNB 54.00 bkl |
| format_se |
Aufsätze |
| author-letter |
Polyvyanyy, Artem |
| doi_str_mv |
10.1145/2980764 |
| dewey-full |
004 |
| title_sort |
impact-driven process model repair |
| title_auth |
Impact-Driven Process Model Repair |
| abstract |
The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs. |
| abstractGer |
The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs. |
| abstract_unstemmed |
The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 |
| container_issue |
4 |
| title_short |
Impact-Driven Process Model Repair |
| url |
http://dx.doi.org/10.1145/2980764 http://dl.acm.org/citation.cfm?id=2980764 |
| remote_bool |
false |
| author2 |
Aalst, Wil Hofstede, Arthur Wynn, Moe |
| author2Str |
Aalst, Wil Hofstede, Arthur Wynn, Moe |
| ppnlink |
13105757X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth |
| doi_str |
10.1145/2980764 |
| up_date |
2024-07-03T20:54:13.051Z |
| _version_ |
1803592718673248256 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1989261787</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220214154612.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">170207s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1145/2980764</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170501</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1989261787</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1989261787</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)a752-f451747947849e7de19bdcff16ee63a09a7acfe0d7eaf66eaf508a2e6913a7fa0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0202023820170000025000400001impactdrivenprocessmodelrepair</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Polyvyanyy, Artem</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Impact-Driven Process Model Repair</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The abundance of event data in today's information systems makes it possible to "confront" process models with the actual observed behavior. Process mining techniques use event logs to discover process models that describe the observed behavior, and to check conformance of process models by diagnosing deviations between models and reality. In many situations, it is desirable to mediate between a preexisting model and observed behavior. Hence, we would like to repair the model while improving the correspondence between model and log as much as possible. The approach presented in this article assigns predefined costs to repair actions (allowing inserting or skipping of activities). Given a maximum degree of change, we search for models that are optimal in terms of fitness-that is, the fraction of behavior in the log not possible according to the model is minimized. To compute fitness, we need to align the model and log, which can be time consuming. Hence, finding an optimal repair may be intractable. We propose different alternative approaches to speed up repair. The number of alignment computations can be reduced dramatically while still returning near-optimal repairs. The different approaches have been implemented using the process mining framework ProM and evaluated using real-life logs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">process model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">event log</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Process mining</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">process model repair</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">repair recommendation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Aalst, Wil</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hofstede, Arthur</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wynn, Moe</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">ACM transactions on software engineering and methodology</subfield><subfield code="d">New York, NY : ACM Press, 1992</subfield><subfield code="g">25(2017), 4, Seite 1-60</subfield><subfield code="w">(DE-627)13105757X</subfield><subfield code="w">(DE-600)1105550-9</subfield><subfield code="w">(DE-576)029156734</subfield><subfield code="x">1049-331X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:4</subfield><subfield code="g">pages:1-60</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1145/2980764</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://dl.acm.org/citation.cfm?id=2980764</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2017</subfield><subfield code="e">4</subfield><subfield code="h">1-60</subfield></datafield></record></collection>
|
| score |
7.398264 |