Learning Planar Ising Models

Details Learning Planar Ising Models Learning Planar Ising Models

2010-11-15

arxiv.org/abs/1011.3494v1

Statistics

Machine Learning

11 pages, 4 figures, Submitted to 14th International Conference on Artificial Intelligence and Statistics (AISTATS 2011)

Scientific paper

Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of random variables within some tractable family of graphical models. In this paper, we focus our attention on the class of planar Ising models, for which inference is tractable using techniques of statistical physics [Kac and Ward; Kasteleyn]. Based on these techniques and recent methods for planarity testing and planar embedding [Chrobak and Payne], we propose a simple greedy algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. We demonstrate our method in some simulations and for the application of modeling senate voting records.

Affiliated with

Also associated with

No associations

Rating

Learning Planar Ising Models 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 Planar Ising Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning Planar Ising Models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-462799