Alpha Algorithm (Process Discovery Method)

Поділитися
Вставка
  • Опубліковано 17 лис 2024

КОМЕНТАРІ • 28

  • @haziqfirdaus4956
    @haziqfirdaus4956 3 роки тому +5

    There's no need to look any further, this is the best video on Alpha Algorithm on UA-cam. Thank you kind sir!

  • @studyconquest8815
    @studyconquest8815  5 років тому +12

    Thanks for the appreciation! Glad to hear it helps!

  • @user-vj5fq6hf4k
    @user-vj5fq6hf4k 2 роки тому +1

    Nice explanation

  • @neoncode6295
    @neoncode6295 7 місяців тому

    Very good explanation! Thank you!

  • @MlleMimii93
    @MlleMimii93 3 роки тому

    Omg thank you so much, I have an exam soon and I completly understand the algo thanks to you ! very clear :)

  • @theomrt
    @theomrt Рік тому

    Thanks for the video !
    But one thing intrigues me: why don't you write: ({a}, {b, c, e}) instead of cutting it in two ?

  • @nuclearcalamity7086
    @nuclearcalamity7086 4 роки тому

    Thank you very much for your explanation! It helped me a lot with me diploma

  • @aprajitasingh5453
    @aprajitasingh5453 4 роки тому

    Well explained. Thanks

  • @irynaivanova7282
    @irynaivanova7282 4 роки тому

    Thank you!Very well explained!

  • @anatya
    @anatya 4 роки тому

    thank you for the explanation

  • @eddycrt5900
    @eddycrt5900 Рік тому

    for the possibles sets, why don't you put b,c and c,b ? Are they irrelevant ?

  • @PeterHalasimind
    @PeterHalasimind 5 років тому +1

    This is very well explained, thanks for your efforts to share this important knowledge. we will make together this world a better place - with process mining as well.

  • @yoelblanco4803
    @yoelblanco4803 2 роки тому

    Thank you! Really useful

  • @smirtiya
    @smirtiya 2 роки тому

    Line 4 of the algorithm uses the all-quantor for both A and B. This would mean that element i in set A must be causally related to all elements in B, and this for every i. Figure at 3:05 does not show this. But your example makes it obvious.

  • @HendrikSchulke
    @HendrikSchulke 5 років тому

    Very good explanation! Thank you very much :)

  • @juliachaasiak1691
    @juliachaasiak1691 4 роки тому

    Well done!

  • @karannchew2534
    @karannchew2534 20 днів тому

    In step 4, why no ({b,c,e},{d})?

    • @abdulrehmanqasim5759
      @abdulrehmanqasim5759 18 днів тому

      b and c are not independent of one another, so this set isn't possible.
      For ({A}, {B}), all entities within A and B must be independent of one another and A and B must have a casual relation

  • @ragsrags2
    @ragsrags2 4 роки тому

    how can we convert this petri net logic to BPMN flow...If I have to discover BPMN process model how would I know which one is XOR/parallel gateways from Petri net outcome?

    • @91leonetammie
      @91leonetammie 3 роки тому

      You'd need the matrix for that. When it has a parallel sign you use the AND gate and when it has the hashtag sign you use the XOR gate.

  • @andynbg9000
    @andynbg9000 5 років тому

    Thank you for this very good and understandable video!
    I got it :)

  • @matthijskeep4222
    @matthijskeep4222 3 роки тому

    Lekker videootje hoor, 'vo

  • @JongeKroost
    @JongeKroost 5 років тому

    Thanks a ton!

  • @kuebolu3617
    @kuebolu3617 5 років тому

    I LOVE IT, Thank You for helping me :)

  • @thestruggler776
    @thestruggler776 3 місяці тому

    i love you

  • @alleskepler9526
    @alleskepler9526 2 роки тому

    My university teacher stole this 1:1 and explained it way worse...