David Maxwell Chickering, Abstract
Microsoft Research
June 3rd 2002, Communications 120 at 3:30 P.M.
In this talk, I will describe a greedy search algorithm that, in the limit of large sample size, will identify the optimal Bayesian network if the data-generating distribution is DAG-perfect. In order to establish the correctness of the algorithm, I will outline a proof of the so-called "Meek Conjecture", which states that for any DAG A that is an independence map of another DAG B, there exists a finite sequence of edge additions and covered edge reversals that transforms B into A such that A remains an independence map of B at each step.
[an error occurred while processing this directive] [an error occurred while processing this directive]