资源分类
》 资源 》论文》Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables

Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables

2020-02-05 | |  42 |   38 |   0

Abstract 

We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian network greatly reduces the complexity of inferences. Yet, being a global property of the graph, it considerably increases the difficulty of the learning process. Our novel algorithm accomplishes this task, scaling both to large domains and to large treewidths. Our novel approach consistently outperforms the state of the art on experiments with up to thousands of variables.

上一篇：Learning a Probabilistic Latent Space of Object Shapes via 3D Generative-Adversarial Modeling

下一篇：Discriminative Gaifman Models

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...