Różnice między wybraną wersją a wersją aktualną.
|
pl:dydaktyka:dss:lab5 [2017/11/21 12:14] kkluza utworzono |
pl:dydaktyka:dss:lab5 [2019/06/27 15:50] |
||
|---|---|---|---|
| Linia 1: | Linia 1: | ||
| - | ====== Process Mining ====== | ||
| - | ===== Disco ===== | ||
| - | |||
| - | In Windows, start the Disco application, and load the sample log: | ||
| - | {{:pl:dydaktyka:bim:purchasingexample.txt|purchasingexample.csv}} | ||
| - | |||
| - | {{:pl:dydaktyka:bim:lab4_2014:1-open.png|}} | ||
| - | |||
| - | See which columns have been matched as: | ||
| - | |||
| - | * case ID | ||
| - | * activity / task (activiti) | ||
| - | * resource [mostly human resources -- person] (resource) | ||
| - | * time [start / completed] (timestamp) | ||
| - | |||
| - | Then, import the data by clicking **"Start import"**. | ||
| - | |||
| - | Check the graph showing the sequence of completed tasks. | ||
| - | |||
| - | How the number of tasks and flows varies according to the changes of the Activities and Paths sliders: | ||
| - | |||
| - | {{:pl:dydaktyka:bim:lab4_2014:2-parametry.png|}} | ||
| - | |||
| - | Look for the answers to the following questions: | ||
| - | * Which task was most often performed? | ||
| - | * Where are the loops in the process? | ||
| - | * What is the most common scenario? | ||
| - | |||
| - | For the most advanced version of the model, click the **"Animation"** button and observe the bottleneck in the process. | ||
| - | |||
| - | Then, click on the ** Performance ** tab on the right hand side of the window and see how the model has changed. | ||
| - | Look for the answers to the following questions: | ||
| - | |||
| - | * Which task takes the longest time (on average) in the process? | ||
| - | * Before which task is the longest delay (waiting for the task)? | ||
| - | |||
| - | In the tab **Statistics** at the top, look for the answers to the following questions: | ||
| - | |||
| - | * How many variants (task sequences) can be observed in the process? | ||
| - | * What is the most common variant? | ||
| - | * Which task was performed the least often? | ||
| - | * Which of the most frequently performed tasks lasts the longest? | ||
| - | |||
| - | In tab **Cases** at the top, look for the answers to the following question: | ||
| - | * In what order the task are usually performed? | ||
| - | |||
| - | Using ** filters **, look for the answers to the following questions: | ||
| - | * What is the most common process path? Choose only the most common variants (those that have at least 5 examples -- cases). | ||
| - | |||
| - | {{ :pl:dydaktyka:bim:lab4_2014:filtr1-warianty.png |}} | ||
| - | |||
| - | * Are there any cases where the "Amend Request for Quotation" task is not performed? \\ (left-click on the selected task and then filter by this task). | ||
| - | |||
| - | {{ :pl:dydaktyka:bim:lab4_2014:filtr2-aktywnosc.png?300 |}} | ||
| - | |||
| - | * How does the process look like for the shortest cases (up to 75 days)? | ||
| - | * Which task takes the longest time? | ||
| - | * What is the purpose of such a long process duration? | ||
| - | |||
| - | Export the event log in a standardized format that will be appropriate for the ProM tool. | ||
| - | |||
| - | ===== ProM ===== | ||
| - | |||
| - | W systemie Linux uruchom aplikację ProM (''ProM.sh'' w katalogu ''/opt/ProM-5.2/'') i otwórz w niej zapisany event log ''PurchasingExample''. | ||
| - | |||
| - | {{:pl:dydaktyka:bim:lab4_2014:logwprom.png?600|}} | ||
| - | |||
| - | {{ :pl:dydaktyka:bim:lab4_2014:wybor-algorytmu-prom.png?200|}} | ||
| - | |||
| - | Następnie kliknij "start analyzing this log", a potem wybierz jeden z algorytmów (podwójnym kliknięciem).\\ | ||
| - | |||
| - | Sprawdź rezultaty używając m.in.: | ||
| - | * Heuristic Miner | ||
| - | * Genetic Algorithm Plugin | ||
| - | * Alpha algorithm plugin | ||
| - | |||
| - | W przypadku niektórych algorytmów wymagane jest ustawienie dodatkowych opcji, w szczególności w przypadku alpha algorytmu potrzebujemy określić, które zdarzenia w event logu zaczynają i kończą określone zadanie: | ||
| - | |||
| - | {{:pl:dydaktyka:bim:lab4_2014:alpha-konfig.png|}} | ||
| - | |||
| - | Na uzyskanej sieci Petriego spróbuj dodatkowo użyć narzędzi konwertujących: | ||
| - | * Petri net reduction | ||
| - | * Labeled WF-net to EPC | ||
| - | |||
| - | ===== Ćwiczenia ===== | ||
| - | |||
| - | Pracując w grupach proszę przeanalizować (dowolnymi narzędziami) następujący event log dokumentujący proces napraw telefonów w firmie: [[http://www.processmining.org/_media/tutorial/repairexample.zip]]. | ||
| - | |||
| - | W grupowym raporcie należy: | ||
| - | * Zaproponować model BPMN, który obrazuje proces (uzasadnić na podstawie wyników eksploracji -- screenshot + parametry dla określonego algorytmu) | ||
| - | * Określić, które zadania w procesie mają najdłuższy czas oczekiwania. | ||
| - | * Zamieścić interesujące obserwacje i wnioski (z uzasadnieniem wynikami eksploracji!). | ||
| - | |||
| - | Max. długość raportu to 4 strony A4 :!: (w tym odpowiednie screenshoty dokumentujące wyciągnięte wnioski) | ||
| - | |||
| - | ===== Materiały dodatkowe ===== | ||
| - | |||
| - | * [[http://fluxicon.com/disco/files/Disco-Tour.pdf|Disco tour]] | ||
| - | * [[http://fluxicon.com/academic/material/files/ProcessMiningTutorial.pdf|Disco process mining tutorial]] | ||
| - | * [[http://tmpmining.win.tue.nl/_media/tutorial/promtutorialv2.pdf|ProM tutorial]] | ||
