82 citations · 167 across the 5 of their papers we have counts for
Showing 2013 · cs.AIShow all
2 papers · 2 filters
cs.AI2013★ 1 cited
Approximation Algorithms for the Loop Cutset Problem
Ann Becker, Dan Geiger
We show how to find a small loop curser in a Bayesian network. Finding such a loop cutset is the first step in the method of conditioning for inference. Our algorithm for finding a…
cs.AI2013★ 12 cited
Perfect Tree-Like Markovian Distributions
Ann Becker, Dan Geiger, Christopher Meek
We show that if a strictly positive joint probability distribution for a set of binary random variables factors according to a tree, then vertex separation represents all and only…