56 citations · 69 across the 3 of their papers we have counts for
3 papers
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.DS2013★ 56 cited
A Sufficiently Fast Algorithm for Finding Close to Optimal Junction Trees
Ann Becker, Dan Geiger
An algorithm is developed for finding a close to optimal junction tree of a given graph G. The algorithm has a worst case complexity O(c^k n^a) where a and c are constants, n is th…
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…