scientific article
From MaRDI portal
Publication:2768324
zbMath0987.68067MaRDI QIDQ2768324
Nathan Srebro, David R. Karger
Publication date: 30 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Efficient approximation of probability distributions with \(k\)-order decomposable models, Graphical models for statistical inference and data assimilation, Graphical Models and Message-Passing Algorithms: Some Introductory Lectures, Learning loopy graphical models with latent variables: efficient methods and guarantees, Discovering a junction tree behind a Markov network by a greedy algorithm, Region selection in Markov random fields: Gaussian case, Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu, Unnamed Item, Learning a tree-structured Ising model in order to make predictions, Computing partial hypergraphs of bounded width, Unnamed Item, High-dimensional structure estimation in Ising models: local separation criterion, Learning tractable Bayesian networks in the space of elimination orders, Tree decompositions and social graphs, Maximum likelihood bounded tree-width Markov networks, Unnamed Item
