Publication - Finding Minimum Data Requirements Using Pseudo-Independence

Authors:	Kim, Yoonheui; Lesser, Victor
Title:	Finding Minimum Data Requirements Using Pseudo-Independence
Abstract:	In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context the amount of agent communication. To achieve this, we introduce Pseudo-Independence, a relaxed independence relation that quantitatively differentiates the various degrees of independence among nodes in a BN. We combine Pseudo-Independence with Context-Specific Independence to obtain a measure, Context-Specific Pseudo-Independence (CSPI), which determines the amount of required data that needs to be used to infer within the error bound. We then use a Conditional Probability Table-based generation search process that utilize CSPI to determine the minimal observation set. We present empirical results to demonstrate that bounded approximate inference can be made with fewer observations.
Keywords:	Communication
Publication:	2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, Vol: 2, pp. 57 - 64
Location:	Australia
Publisher:	IEEE Computer Society
Date:	2008
Sources:	PDF: /Documents/ykim_iat08.pdf PDF: http://www.cs.umass.edu/~ykim/ykim_iat08.pdf
Reference:	Kim, Yoonheui; Lesser, Victor. Finding Minimum Data Requirements Using Pseudo-Independence. 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, Volume 2, IEEE Computer Society, pp. 57-64. 2008.
`bibtex`:	@article{Kim-463, author = "Yoonheui Kim and Victor Lesser", title = "{Finding Minimum Data Requirements Using Pseudo-Independence}", journal = "2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology", volume = "2", publisher = "IEEE Computer Society", pages = "57-64", year = "2008", address = "Australia", url = "http://mas.cs.umass.edu/paper/463", }