Structure Learning of Partitioned Markov Networks

04/02/2015

∙

We learn the structure of a Markov Network between two groups of random variables from joint observations. Since modelling and learning the full MN structure may be hard, learning the links between two groups directly may be a preferable option. We introduce a novel concept called the partitioned ratio whose factorization directly associates with the Markovian properties of random variables across two groups. A simple one-shot convex optimization procedure is proposed for learning the sparse factorizations of the partitioned ratio and it is theoretically guaranteed to recover the correct inter-group structure under mild conditions. The performance of the proposed method is experimentally compared with the state of the art MN structure learning methods using ROC curves. Real applications on analyzing bipartisanship in US congress and pairwise DNA/time-series alignments are also reported.

READ FULL TEXT

Structure Learning of Partitioned Markov Networks

Markov Chain Concentration with an Application in Reinforcement Learning

Learning Sparse Structural Changes in High-dimensional Markov Networks: A Review on Methodologies and Theories

Multiscale clustering of nonparametric regression curves

Learning Markov Network Structure using Brownian Distance Covariance

Efficient Independence-Based MAP Approach for Robust Markov Networks Structure Discovery

Independence clustering (without a matrix)

Structure Learning of Partitioned Markov Networks

Related Research

Markov Chain Concentration with an Application in Reinforcement Learning

Learning Sparse Structural Changes in High-dimensional Markov Networks: A Review on Methodologies and Theories

Multiscale clustering of nonparametric regression curves

Learning Markov Network Structure using Brownian Distance Covariance

Efficient Independence-Based MAP Approach for Robust Markov Networks Structure Discovery

Independence clustering (without a matrix)