Despite the increasing popularity of Bayesian networks for representing and reasoning about uncertain situations, the complexity of inference in this formalism remains a significant concern. A viable approach to relieving the problem is trading off accuracy for computational efficiency. To this end, varying the granularity of state space of state variables appears to be a feasible strategy for controlling the evaluation process. We consider an anytime procedure for approximate evaluation of Bayesian networks based on this idea. On application to some simple networks, the procedure exhibits a smooth improvement in approximation quality as computation time increases. With the aim of developing principled control techniques, we also conduct a theoretical analysis of the quality of approximation. Our main result demonstrates that the error induced by state-space abstraction deceases with the distance from the abstracted nodes, where "distance" is defined in terms of d-separation. While the empirical results suggest that incremental state-space abstraction offers a viable performance profile, the theoretical results represent a starting point for the deliberation scheduling of our anytime approximation method.
End of preview. The entire article is 8 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/on-state-space-abstraction-for-anytime-evaluation-of-bayesian-networks-DxzuwpwyFQ
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
On state-space abstraction for anytime evaluation of Bayesian networks
Liu, Chao-Lin; Wellman, Michael P.
Follow ACM SIGART Bulletin
, Volume 7 (2)
Association for Computing Machinery – Apr 1, 1996
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
