Maximum likelihood bounded tree-width Markov networks (Q1853683): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Information geometry on hierarchy of probability distributions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4092750 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximating discrete probability distributions with dependence trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023085 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768324 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphical and Recursive Models for Contingency Tables / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2088762494 / rank | |||
Normal rank |
Latest revision as of 11:01, 30 July 2024
scientific article
In more languages
ConfigureLanguage | Label | Description | Also known as |
---|---|---|---|
English | Maximum likelihood bounded tree-width Markov networks |
scientific article |
Statements
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.