Maximum likelihood bounded tree-width Markov networks
From MaRDI portal
Publication:1853683
DOI10.1016/S0004-3702(02)00360-0zbMath1011.68066arXiv1301.2311OpenAlexW2088762494MaRDI QIDQ1853683
Publication date: 22 January 2003
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.2311
hardnessMarkov random fieldstree-widthundirected graphical modelsMarkov networksentropy decompositionhyper-trees
Related Items
Efficient approximation of probability distributions with \(k\)-order decomposable models, Efficient learning of Bayesian networks with bounded tree-width, Learning decomposable Markov networks in pseudo-independent domains with local evaluation, Objective Bayesian Nets for Integrating Consistent Datasets, Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu, Computing partial hypergraphs of bounded width, Learning multi-linear representations of distributions for efficient inference, High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
Cites Work
