Reasoning MPE to Multiply Connected Belief Networks Using Message Passing

Bon K. Sy

This paper presents an efficient algorithm for finding l (>= 2) MPE in singly-connected networks and the extension of this algorithm for multiply-connected networks.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.