arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.02113cs.LGcs.AI
收藏

Selective Greedy Equivalence Search:使用多项式得分评估数寻找最优贝叶斯网络

Selective Greedy Equivalence Search: Finding Optimal Bayesian Networks Using a Polynomial Number of Score Evaluations

Microsoft Research(微软研究院)

David Maxwell Chickering, Christopher Meek

摘要:

我们介绍了选择性贪婪等价搜索(SGES),贪婪等价搜索(GES)的限制版本。SGES保留了GES的渐近正确性,但与GES不同,它具有多项式性能保证。特别是,我们表明,当数据独立于相对于在可观察变量上定义的DAG ${\cal G}$是完美的分布进行采样时,在大数据的限制下,SGES将在多个得分评估后识别${\cal G}$的等价类,该得分评估是(1)节点数的多项式和(2)各种复杂性度量的指数,包括最大父节点数,maximum-clique-size,以及一个称为{ \em v-width}的新度量,它至少与--一样小,并且可能比-其他两个小得多。更一般地说,我们发现,对于任何遗传和等价不变的属性$Π$已知持有${\cal G}$,我们保留大样本的最优保证GES,即使我们忽略任何GES删除运营商在向后的阶段,结果在一个状态,其中$Π$不持有的共同后代子图。

英文摘要:

We introduce Selective Greedy Equivalence Search (SGES), a restricted version of Greedy Equivalence Search (GES). SGES retains the asymptotic correctness of GES but, unlike GES, has polynomial performance guarantees. In particular, we show that when data are sampled independently from a distribution that is perfect with respect to a DAG ${\cal G}$ defined over the observable variables then, in the limit of large data, SGES will identify ${\cal G}$'s equivalence class after a number of score evaluations that is (1) polynomial in the number of nodes and (2) exponential in various complexity measures including maximum-number-of-parents, maximum-clique-size, and a new measure called {\em v-width} that is at least as small as---and potentially much smaller than---the other two. More generally, we show that for any hereditary and equivalence-invariant property $Π$ known to hold in ${\cal G}$, we retain the large-sample optimality guarantees of GES even if we ignore any GES deletion operator during the backward phase that results in a state for which $Π$ does not hold in the common-descendants subgraph.

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

↑