Computing Upper and Lower Bounds on Likelihoods in Intractable Networks

dc.creator	Jaakkola, Tommi S.
dc.creator	Jordan, Michael I.
dc.date	2004-10-08T20:36:27Z
dc.date	2004-10-08T20:36:27Z
dc.date	1996-03-01
dc.date.accessioned	2013-10-09T02:46:22Z
dc.date.available	2013-10-09T02:46:22Z
dc.date.issued	2013-10-09
dc.identifier	AIM-1571
dc.identifier	http://hdl.handle.net/1721.1/6653
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	We present techniques for computing upper and lower bounds on the likelihoods of partial instantiations of variables in sigmoid and noisy-OR networks. The bounds determine confidence intervals for the desired likelihoods and become useful when the size of the network (or clique size) precludes exact computations. We illustrate the tightness of the obtained bounds by numerical experiments.
dc.format	319284 bytes
dc.format	614775 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AIM-1571
dc.title	Computing Upper and Lower Bounds on Likelihoods in Intractable Networks

Files in this item

Files	Size	Format	View
There are no files associated with this item.