14th International Workshop on Business Process Intelligence 2018

to be held in conjunction with BPM 2018 Sydney, Australia, September 9 - 14, 2018


|

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Last revision Both sides next revision
2018:start [2018/06/22 14:16]
bfvdonge [Description]
2018:start [2018/08/20 10:48]
bfvdonge [Workshop Program]
Line 61: Line 61:
 | |
 |- style="​background-color:#​f0f0d3;"​ |- style="​background-color:#​f0f0d3;"​
-|Workshop ​Days:                            ​+|Workshop ​Day:                            ​
 | valign="​center"​ | 10 September 2018 | valign="​center"​ | 10 September 2018
  
Line 74: Line 74:
  
 ===== Workshop Program ===== ===== Workshop Program =====
-The BPI 2018 workshop will be held on 9 - 10 September 2018 in Sydney, Australia. The accepted papers will be presented during the workshop and authors have ample time for their presentations and discussion.+The BPI 2018 workshop will be held on 10th September 2018 in Sydney, Australia. The accepted papers will be presented during the workshop and authors have ample time for their presentations and discussion.
  
 At the end of the workshop, the winner for the international Business Process Intelligence Challenge ([[:​2018:​Challenge|BPI Challenge]]) will be announced. ​ At the end of the workshop, the winner for the international Business Process Intelligence Challenge ([[:​2018:​Challenge|BPI Challenge]]) will be announced. ​
  
 +<​exttab1>​
 +{|
 +|- style="​background-color:#​cccc99;"​
 +|<​b>​Monday</​b>​
 +|<​b>​10 september 2018</​b>​
 +|
 +|- style="​background-color:#​f0f0d3;"​
 +|9:00 - 9:05
 +| Opening
 +|
 +|-
 +|9:05 - 9:45
 +| Jana-Rebecca Rehse and Peter Fettke. </​br><​a href="​http://​www.win.tue.nl/​bpi/​lib/​exe/​fetch.php?​media=2018:​bpi2018_paper_2.pdf"><​b>​Clustering Business Process Activities for Identifying Reference Model Components</​b></​a>​
 +|
 +|- style="​background-color:#​f0f0d3;"​
 +|9:50 - 10:30
 +| Maikel van Eck, Natalia Sidorova and Wil van der Aalst. </​br></​br><​a href="​http://​www.win.tue.nl/​bpi/​lib/​exe/​fetch.php?​media=2018:​bpi2018_paper_4.pdf"><​b>​Multi-Instance Mining: Discovering Synchronisation in Artifact-Centric Processes</​b></​a>​
 +|
 +|- 
 +|10:30 - 11:00
 +| <​i>​Coffee break</​i>​
 +|
 +|- style="​background-color:#​f0f0d3;"​
 +|11:00 - 11:40
 +| Wai Lam Jonathan Lee, Jorge Munoz-Gama, H.M.W. Verbeek, Wil M.P. van der Aalst and Marcos SepĂșlveda. </​br></​br><​a href="​http://​www.win.tue.nl/​bpi/​lib/​exe/​fetch.php?​media=2018:​bpi2018_paper_1.pdf"><​b>​Improving merging conditions for recomposing conformance checking</​b></​a>​
 +|
 +|- 
 +|11:45 - 12:25
 +| Boudewijn van Dongen. </​br></​br><​a href="​http://​www.win.tue.nl/​bpi/​lib/​exe/​fetch.php?​media=2018:​bpi2018_paper_5.pdf"><​b>​Efficiently Computing Alignments - Algorithm and Datastructures</​b></​b>​
 +|
 +|- style="​background-color:#​f0f0d3;"​
 +|12:30 - 14:00
 +| <​i>​Lunch break</​i> ​
 +|
 +|-
 +|14:00 - 14:40
 +| Galina Deeva and Jochen De Weerdt. </​br></​br><​a href="​http://​www.win.tue.nl/​bpi/​lib/​exe/​fetch.php?​media=2018:​bpi2018_paper_21.pdf"><​b>​Understanding automated feedback in learning processes by mining local patterns</​b></​a>​
 +|
 +|- style="​background-color:#​f0f0d3;"​
 +|14:45 - 15:00
 +| Announcement BPI Challenge Winners
 +|
 +|- 
 +|15:00 - 15:30
 +| BPI Challenge professional winner
 +|
 +|- style="​background-color:#​f0f0d3;"​
 +|15:30 - 16:00
 +| <​i>​Coffee break</​i>​
 +|
 +|- 
 +|16:00 - 16:30
 +| BPI Challenge academic winner ​
 +|
 +|- style="​background-color:#​f0f0d3;"​
 +|16:30 - 17:00
 +| BPI Challenge student winner ​
 +|
 +|- 
 +|17:00 - 17:00
 +| Workshop closing ​
 +|
 +|- style="​background-color:#​f0f0d3;"​
 +|17:00 - 18:00
 +| <​b>​Meeting IEEE Task Force on Process Mining</​b>​
 +|
 +|- 
 +|19:00 onwards
 +|<​i>​Welcome reception</​i>​
 +|
 +|}
 +</​exttab1>​
  
 ===== Description ===== ===== Description =====