Variable and Value Ordering for MPE Search
Description
In Bayesian networks, a most probable explanation (MPE) is a most likely instantiation of all network variables given a piece of evidence. Recent work proposed a branch-and-bound search algorithmthat finds exact solutions to MPE queries, where bounds are
Collections | ANU Research Publications |
---|---|
Date published: | 2009 |
Type: | Conference paper |
URI: | http://hdl.handle.net/1885/58555 |
Source: | Proceedings of International Joint Conference on Artificial Intelligence (IJCAI 2009) |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Siddiqi_Variable_and_Value_Ordering_2009.pdf | 239.58 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator