Computing Upper and Lower Bounds on Likelihoods in Intractable Networks
| dc.date.accessioned | 2004-10-08T20:36:27Z | |
| dc.date.accessioned | 2018-11-24T10:21:23Z | |
| dc.date.available | 2004-10-08T20:36:27Z | |
| dc.date.available | 2018-11-24T10:21:23Z | |
| dc.date.issued | 1996-03-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6653 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6653 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 319284 bytes | |
| dc.format.extent | 614775 bytes | |
| dc.language.iso | en_US | |
| dc.title | Computing Upper and Lower Bounds on Likelihoods in Intractable Networks | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-1571.pdf | 614.7Kb | application/pdf | View/ |
| AIM-1571.ps | 319.2Kb | application/postscript | View/ |