.png){kind=icon}
返回
Maximum likelihood bounded tree-width Markov networks
.png){kind=icon}
OA
AI
DOI：10.1016/S0004-3702(02)00360-0.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2002 Elsevier Science B.V All rights reserved.
Keyword:
Markov networks
Markov random fields
undirected graphical models
entropy decomposition
hyper-trees
tree-width
hardness
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏