Computing Upper and Lower Bounds on Likelihoods in Intractable Networks (1996)

by Tommi S. Jaakkola , Michael Jordan , Michael I
Citations:41 - 9 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
7195 Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference – J Pearl - 1988
576 Probabilistic Inference Using Markov Chain Monte Carlo Methods – Radford M. Neal - 1993
185 Connectionist learning of belief networks – R M Neal - 1992
8734 Elements of Information Theory – T M Cover, J A Thomas - 1991
8326 Maximum likelihood from incomplete data via the EM algorithm – A. P. Dempster, N. M. Laird, D. B. Rubin - 1977
781 A View Of The Em Algorithm That Justifies Incremental, Sparse, And Other Variants – Radford Neal, Geoffrey E. Hinton - 1998
123 Mean Field Theory for Sigmoid Belief Networks – Lawrence K. Saul, Tommi Jaakkola, Michael I. Jordan - 1996
3329 Convex Analysis – R. Tyrrell Rockafellar - 1970