资源分类
》 资源 》论文》Learning Optimal Bayesian Networks Using A* Search

Learning Optimal Bayesian Networks Using A* Search

2019-11-12 | |  67 |   48 |   0

Abstract

This paper formulates learning optimal Bayesian network as a shortest path finding problem. An A*search algorithm is introduced to solve the prob-lem. With the guidance of a consistent heuristic,the algorithm learns an optimal Bayesian network by only searching the most promising parts of the solution space. Empirical results show that the A*search algorithm significantly improves the time and space efficiency of existing methods on a set of benchmark datasets.


上一篇：Lifted Probabilistic Inference by First-Order Knowledge Compilation

下一篇：Bayesian Chain Classifiers for Multidimensional Classification

用户评价
全部评价

热门资源

  • 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 ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...