Różnice między wybraną wersją a wersją aktualną.
| Both sides previous revision Poprzednia wersja Nowa wersja | Poprzednia wersja | ||
|
pl:dydaktyka:dss:lab03 [2020/11/02 15:23] kkluza [Alpha Plus] |
pl:dydaktyka:dss:lab03 [2020/11/16 17:57] (aktualna) kkluza [Report] |
||
|---|---|---|---|
| Linia 173: | Linia 173: | ||
| So for discovering self-loops and short loops, you need to construct the additional matrix and exclude the discovered relations from the footprint matrix of the Alpha algorithm. | So for discovering self-loops and short loops, you need to construct the additional matrix and exclude the discovered relations from the footprint matrix of the Alpha algorithm. | ||
| + | |||
| + | ^ | a | b | c | ... | | ||
| + | | aτa | | ✓ | | | | ||
| + | | bτb | | | | | | ||
| + | | cτc | | | | | | ||
| + | | ... | | | | | | ||
| ====== Excercise ====== | ====== Excercise ====== | ||
| Linia 202: | Linia 208: | ||
| ====== Report ====== | ====== Report ====== | ||
| - | <fc #ff0000>**This lab will be conducted 26.10.2020 and 2.11.2020.\\ The deadline for the report is 10.11.2020**.</fc> | + | <fc #ff0000>**This lab will be conducted 26.10.2020 and 2.11.2020.\\ The deadline for the report is <del>10.11.2020</del> 23.11.2020**.</fc> |
| + | |||
| + | ** The lab on <del>9.11.2020</del> 16.11.2020 will be only as consultation hours for people who want to consult their mini-project concerning the implementation of Heuristic miner or some other advanced miner**. | ||
| - | ** The lab on 9.11.2020 will be only as consultation hours for people who want to consult their mini-project concerning the implementation of Heuristic miner or some other advanced miner**. | + | <fc #ff0000>**On the UPEL platform, you can find some log examples of various complexity**:\\ |
| + | https://upel2.cel.agh.edu.pl/weaiib/mod/resource/view.php?id=40748 | ||
| + | \\ | ||
| + | Be aware that not for all of these logs you will be able to get a correct solution, as some of the constructs may not be supported by your algorithm. However, as the provided logs are quite simple, it should be easy to check your solutions using them. | ||
| + | </fc> | ||
| The basic report should contain: | The basic report should contain: | ||
| Linia 218: | Linia 230: | ||
| For 5 points (i.e. very good grade 5.0) [mini-project]: | For 5 points (i.e. very good grade 5.0) [mini-project]: | ||
| - | * **It is required at least one consultation on 9.11.2020** (or other date according to the individual arrangement). | + | * **It is required at least one consultation on <del>9.11.2020</del> 16.11.2020** (or other date according to the individual arrangement). |
| * It is required to provide your implementation of Heuristic miner based on the previous implementation of an extension of the Alpha algorithm. | * It is required to provide your implementation of Heuristic miner based on the previous implementation of an extension of the Alpha algorithm. | ||
| - | * It is also possible to choose some other advanced miner like ILP Miner, Split Miner, Evolutionary Tree Miner, Local Process Model Miner. For such a choice the extension of the deadline till December is possible. | + | * It is also possible to choose some other advanced miner like ILP Miner, Split Miner, Evolutionary Tree Miner, Local Process Model Miner. For such a choice the extension of the deadline till the end of December is possible. In the case of correct implementation and evaluation of these complex miners, no other reports will be necessary and the final score will be 5.0 (bdb). |
| Additional 0.5-1 point may be granted for the groups which will cover some of the following issues (this should be explained and justified in the report): | Additional 0.5-1 point may be granted for the groups which will cover some of the following issues (this should be explained and justified in the report): | ||
