Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

UAI
2001

favoriteEmaildiscussreport

97views Artificial Intelligence» more UAI 2001»

Maximum Likelihood Bounded Tree-Width Markov Networks

13 years 6 months ago

Maximum Likelihood Bounded Tree-Width Markov Networks

Download www.it.iitb.ac.in

We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatorial optimization problem of finding a maximum weight hypertree, we prove that it is NP-hard to solve exactly and provide an approximation algorithm with a provable performance guarantee.

Nathan Srebro

Real-time Traffic

Combinatorial Optimization Problem | Maximum Likelihood Distribution | Maximum Weight Hypertree | UAI 2001 | UAI 2008 |

claim paper

Related Content

» Polyhedral conditions for the nonexistence of the MLE for hierarchical loglinear models

» Learning Markov networks maximum bounded treewidth graphs

» On LowComplexity MaximumLikelihood Decoding of Convolutional Codes

» Probabilistic models for biological sequences selection and Maximum Likelihood estimation

» MaximumLikelihood Decoding and Performance Analysis of a Noisy Channel Network with Networ...

» Maximum likelihood network topology identification from edgebased unicast measurements

» Laplace maximum margin Markov networks

» An Input Output HMM Architecture

» Learning Factor Graphs in Polynomial Time and Sample Complexity

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	UAI
Authors	Nathan Srebro

Comments (0)