Undirected Graphical Models

Поделиться
HTML-код
  • Опубликовано: 14 янв 2025

Комментарии • 21

  • @liberator328
    @liberator328 5 лет назад +11

    I've been taught MRFs twice now, and I have to say this is the most informative way I've had it taught. Great job!

  • @tinayang7351
    @tinayang7351 5 лет назад +49

    on 6:50, why not {B} included in the separating subset?

  • @ryanlashkevich9615
    @ryanlashkevich9615 2 месяца назад

    What a good channel i've come across. This will definitely become a part of my library to extend my problem solving toolbox as a developer.
    Thank you!

  • @achintgr8
    @achintgr8 2 года назад +1

    This was amazing! Struggling to understand the conundrum of MRFs. This video is the only good resource I've come across which explains it so clearly. Thanks. 😊

  • @neoneo1503
    @neoneo1503 2 года назад +1

    A great explanation at 16:48! Bayes Net can be converted to MRF but lose marginal independence when a shared child occurs.

  • @amerashka
    @amerashka 4 года назад +1

    I need to read more about Markov Random Field in detail, can you suggest any resource?

  • @rickstoic6907
    @rickstoic6907 2 года назад

    Thank you Professor Huang.

  • @nehalkalita
    @nehalkalita 6 месяцев назад

    11:49 Can anyone tell me why phi(A, C) = P(C|A) and not P(A)P(C|A)?

  • @reanwithkimleng
    @reanwithkimleng 8 месяцев назад

    Thanks for helping me❤❤❤

  • @teodorstoev9174
    @teodorstoev9174 5 лет назад +1

    Hi! Nice video! What I can not understand is what is a "potential function" ? From what I see, they do not represent a distribution since they do not sum up to 1, but what I can not understand is how do we define these functions...Could you explain it?

    • @JakkuSakura
      @JakkuSakura 4 года назад

      Hi, the Z (sum of potential of cliques) denominator will get the sum to 1

  • @sandwichc
    @sandwichc 3 года назад

    Thanks for great explanation. One question: why bother converting a BN into an MRF?

    • @vaibhavarora9408
      @vaibhavarora9408 3 года назад

      You would be able to use a general algorithm of message passing for inference that holds for junction trees

  • @DominoDay4Live
    @DominoDay4Live 6 лет назад +1

    Great Video!

  • @lishanjiang260
    @lishanjiang260 5 лет назад +1

    Really good lecture!!

  • @javiertan2080
    @javiertan2080 5 лет назад +1

    Simple and clear!

  • @HoangTran-bu2ej
    @HoangTran-bu2ej 9 месяцев назад

    what is 'phi' sir

  • @wahabfiles6260
    @wahabfiles6260 5 лет назад

    What is a maximal clique?

    • @berty38
      @berty38  5 лет назад +9

      A clique is a set of nodes that are all directly connected to each other. A maximal clique is a clique that is not contained in a larger clique. E.g., a triangle ABC is a clique, but so is AB. ABC contains AB, so AB can't be a maximal clique.

    • @wahabfiles6260
      @wahabfiles6260 5 лет назад

      @@berty38
      Makes so much sense! Awesome explanation.