Computing Upper and Lower Bounds on Likelihoods in Intractable Networks

Jaakkola, Tommi S., Jordan, Michael I.

arXiv.org Artificial Intelligence 

These techniques become useful when the size of the network (or clique size) precludes exact computations. We illustrate the tightness of the bounds by numerical experiments.

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found