Abstract

This paper investigates the problem of belief update in Bayesian networks (BN) with uncertain evidence. Two types of uncertain evidences are identified: virtual evidence (reflecting the uncertainty one has about a reported observation) and soft evidence (reflecting the uncertainty of an event one observes). Each of the two types of evidence has its own characteristics and obeys a belief update rule that is different from hard evidence, and different from each other. The particular emphasis is on belief update with multiple uncertain evidences. Efficient algorithms for BN reasoning with consistent and inconsistent uncertain evidences are developed, and their convergences analyzed. These algorithms can be seen as combining the techniques of traditional BN reasoning, Pearl's virtual evidence method, Jeffrey's rule, and the iterative proportional fitting procedure.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.