Learning Graph Structure in Discrete Markov Random Fields

Details Learning Graph Structure in Discrete Markov Random Fields Learning Graph Structure in Discrete Markov Random Fields

2012-04-25

arxiv.org/abs/1204.5540v1

Statistics

Machine Learning

43 pages

Scientific paper

We present a general algorithm for learning the structure of discrete Markov random fields from i.i.d. samples. Several algorithms have been proposed for structure learning algorithms earlier and each of these address the learning problem under different assumptions. Our algorithm provides a unified view in the following sense: when our algorithm is applied to each of the special cases, it results in a the same computational complexity as earlier algorithms. More importantly, our approach also provides a new low-computational complexity algorithm for the case of Ising models where the underlying graph is the Erdos-Renyi random graph G(p,c/p).

Affiliated with

Also associated with

No associations

Rating

Learning Graph Structure in Discrete Markov Random Fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Learning Graph Structure in Discrete Markov Random Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning Graph Structure in Discrete Markov Random Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137326