Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models
暂无分享,去创建一个
[1] Mikko Koivisto,et al. Learning Chordal Markov Networks by Dynamic Programming , 2014, NIPS.
[2] Christian Blum,et al. Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming , 2014, Probabilistic Graphical Models.
[3] Iñaki Inza,et al. Efficient approximation of probability distributions with k-order decomposable models , 2016, Int. J. Approx. Reason..
[4] Nathan Srebro,et al. Maximum likelihood bounded tree-width Markov networks , 2001, Artif. Intell..
[5] Jukka Corander,et al. Learning Chordal Markov Networks by Constraint Satisfaction , 2013, NIPS.
[6] Francesco M. Malvestuto,et al. Approximating discrete probability distributions with decomposable models , 1991, IEEE Trans. Syst. Man Cybern..
[7] Michael I. Jordan,et al. Efficient Stepwise Selection in Decomposable Models , 2001, UAI.
[8] Steffen L. Lauritzen,et al. Graphical models in R , 1996 .
[9] Nir Friedman,et al. Probabilistic Graphical Models - Principles and Techniques , 2009 .
[10] Milan Studený,et al. Towards using the chordal graph polytope in learning decomposable models , 2017, Int. J. Approx. Reason..
[11] Nathan Srebro,et al. Maximum likelihood Markov networks : an algorithmic approach , 2000 .