Structure Learning of Partitioned Markov Networks
Abstract
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 \emphpartitioned 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 \emphsparse 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.
Cite
Text
Liu et al. "Structure Learning of Partitioned Markov Networks." International Conference on Machine Learning, 2016.Markdown
[Liu et al. "Structure Learning of Partitioned Markov Networks." International Conference on Machine Learning, 2016.](https://mlanthology.org/icml/2016/liu2016icml-structure/)BibTeX
@inproceedings{liu2016icml-structure,
title = {{Structure Learning of Partitioned Markov Networks}},
author = {Liu, Song and Suzuki, Taiji and Sugiyama, Masashi and Fukumizu, Kenji},
booktitle = {International Conference on Machine Learning},
year = {2016},
pages = {439-448},
volume = {48},
url = {https://mlanthology.org/icml/2016/liu2016icml-structure/}
}