资源分类
》 资源 》论文》Advances in Learning Bayesian Networks of Bounded Treewidth

Advances in Learning Bayesian Networks of Bounded Treewidth

2020-01-19 | |  52 |   30 |   0

Abstract

This work presents novel algorithms for learning Bayesian networks of bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed integer linear programming formulations for structure learning and treewidth computation. The approximate method consists in sampling k-trees (maximal graphs of treewidth k), and subsequently selecting, exactly or approximately, the best structure whose moral graph is a subgraph of that k-tree. The approaches are empirically compared to each other and to state-of-the-art methods on a collection of public data sets with up to 100 variables.

上一篇：Constant Nullspace Strong Convexity and Fast Convergence of Proximal Methods under High-Dimensional Settings

下一篇：On Communication Cost of Distributed Statistical Estimation and Dimensionality

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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