Maximum Likelihood Bounded Tree-Width Markov Networks
Chow and Liu (1968) studied the problem of learning a maximumlikelihood Markov tree. We generalize their work to more complexMarkov networks by considering the problem of learning a maximumlikelihood Markov network of bounded complexity. We discuss h…
Authors: Nathan Srebro
[ l 1 . , {( 1 - - ( )
Original Paper
Loading high-quality paper...
Comments & Academic Discussion
Loading comments...
Leave a Comment