Learning Non-Parametric Markov Networks with Mutual Information
Abstract
We propose a method for learning Markov network structures for continuous data without assuming any particular parametric distribution for the variables. The method makes use of previous work on a non-parametric estimator for mutual information which is used to create a non-parametric test for multivariate conditional independence. This independence test is then combined with an efficient constraint-based algorithm for learning the graph structure. The performance of the method is evaluated on several synthetic data sets and it is shown to learn more accurate structures than competing methods when the dependencies between the variables involve non-linearities.
Cite
Text
Leppä-Aho et al. "Learning Non-Parametric Markov Networks with Mutual Information." Proceedings of the Ninth International Conference on Probabilistic Graphical Models, 2018.Markdown
[Leppä-Aho et al. "Learning Non-Parametric Markov Networks with Mutual Information." Proceedings of the Ninth International Conference on Probabilistic Graphical Models, 2018.](https://mlanthology.org/pgm/2018/leppaaho2018pgm-learning/)BibTeX
@inproceedings{leppaaho2018pgm-learning,
title = {{Learning Non-Parametric Markov Networks with Mutual Information}},
author = {Leppä-Aho, Janne and Räisänen, Santeri and Yang, Xiao and Roos, Teemu},
booktitle = {Proceedings of the Ninth International Conference on Probabilistic Graphical Models},
year = {2018},
pages = {213-224},
volume = {72},
url = {https://mlanthology.org/pgm/2018/leppaaho2018pgm-learning/}
}