arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.2283cs.LGcs.AIstat.ML
收藏

贝叶斯网络学习的改进

Improved learning of Bayesian networks

Univ. of Economics Prague(布拉格经济大学);University of Utrecht(乌得勒支大学)

Tomas Kocka, Robert Castelo

摘要:

贝叶斯网络结构的搜索空间通常被定义为无环有向图(DAG),搜索通过DAG的局部变换来完成。但是贝叶斯网络的空间是由DAG马尔可夫模型包含来排序的,很自然地认为一个好的搜索策略应该考虑到这一点。第一次尝试(Chickering 1996)是使用DAG的等价类而不是DAG本身。这种方法可以产生更好的结果,但速度要慢得多。我们提出了这两种方法之间的妥协。它使用DAG来搜索空间,以这样一种方式,即考虑到包含的排序。这是通过在DAG的等价类内重复使用局部移动来实现的。我们表明,这种新的方法产生更好的结果比原来的DAG的方法没有实质性的变化,时间复杂度。我们目前的实证结果,启发式搜索和马尔可夫链蒙特卡罗的框架内,通过报警数据集提供。

英文摘要:

The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Bayesian Networks is ordered by DAG Markov model inclusion and it is natural to consider that a good search policy should take this into account. First attempt to do this (Chickering 1996) was using equivalence classes of DAGs instead of DAGs itself. This approach produces better results but it is significantly slower. We present a compromise between these two approaches. It uses DAGs to search the space in such a way that the ordering by inclusion is taken into account. This is achieved by repetitive usage of local moves within the equivalence class of DAGs. We show that this new approach produces better results than the original DAGs approach without substantial change in time complexity. We present empirical results, within the framework of heuristic search and Markov Chain Monte Carlo, provided through the Alarm dataset.

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

↑