arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1206.3244cs.AI
收藏

基于加权MAX-SAT编译的贝叶斯网络学习

Bayesian network learning by compiling to weighted MAX-SAT

University of York(约克大学);York Centre for Complex Systems Analysis(约克复杂系统分析中心);Department of Computer Science(计算机科学系)

James Cussens

摘要:

从数据中学习离散贝叶斯网络的问题被编码为加权MAX-SAT问题,MaxWalkSat局部搜索算法用于解决它。对于每个数据集,在应用MaxWalkSat之前,计算不同父母选择(“家庭分数”)的(BDeu)边际似然的每个变量的和。每个变量的父母的每一个允许的选择被编码为一个不同的命题原子和相关的家庭得分编码为一个“软”加权单文字子句。两种方法来执行无环性被认为是:无论是通过编码的祖先关系,或通过附加一个总的顺序,每个图和编码。后一种方法效果更好。学习实验已经进行了21个合成数据集从7 BN采样。最大的数据集有10,000个数据点和60个变量,产生(对于“祖先”编码)具有19,932个原子和269,367个子句的加权CNF输入文件。对于大多数数据集,MaxWalkSat可以快速找到BDeu分数高于“真实”BN的BN。评估了添加先验信息的效果。它进一步表明,贝叶斯模型平均可以通过收集搜索过程中产生的BN的影响。

英文摘要:

The problem of learning discrete Bayesian networks from data is encoded as a weighted MAX-SAT problem and the MaxWalkSat local search algorithm is used to address it. For each dataset, the per-variable summands of the (BDeu) marginal likelihood for different choices of parents ('family scores') are computed prior to applying MaxWalkSat. Each permissible choice of parents for each variable is encoded as a distinct propositional atom and the associated family score encoded as a 'soft' weighted single-literal clause. Two approaches to enforcing acyclicity are considered: either by encoding the ancestor relation or by attaching a total order to each graph and encoding that. The latter approach gives better results. Learning experiments have been conducted on 21 synthetic datasets sampled from 7 BNs. The largest dataset has 10,000 datapoints and 60 variables producing (for the 'ancestor' encoding) a weighted CNF input file with 19,932 atoms and 269,367 clauses. For most datasets, MaxWalkSat quickly finds BNs with higher BDeu score than the 'true' BN. The effect of adding prior information is assessed. It is further shown that Bayesian model averaging can be effected by collecting BNs generated during the search.

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

↑