arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.13843cs.AIcs.LG
收藏

涡轮增压树宽有界贝叶斯网络结构学习

Turbocharging Treewidth-Bounded Bayesian Network Structure Learning

TU Wien(维也纳工业大学)

Vaidyanathan P. R., Stefan Szeider

摘要:

提出了一种学习树宽有界贝叶斯网络结构的新方法。我们的方法的关键是在本地应用一种精确的方法(基于MaxSAT),以提高精确计算的BN的分数。这种方法使我们能够将精确方法的能力-到目前为止仅适用于具有几十个随机变量的BN-扩展到具有几千个随机变量的大型BN。我们的实验表明,我们的方法提高了国家的最先进的探试法提供的BN的分数,往往显着。

英文摘要:

We present a new approach for learning the structure of a treewidth-bounded Bayesian Network (BN). The key to our approach is applying an exact method (based on MaxSAT) locally, to improve the score of a heuristically computed BN. This approach allows us to scale the power of exact methods -- so far only applicable to BNs with several dozens of random variables -- to large BNs with several thousands of random variables. Our experiments show that our method improves the score of BNs provided by state-of-the-art heuristic methods, often significantly.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑