Author Topic: reference for Max-Propagation algorithm  (Read 12878 times)

Offline MB

  • Newbie
  • *
  • Posts: 9
    • View Profile
reference for Max-Propagation algorithm
« on: July 01, 2010, 20:49:11 »
Can you please provide a reference for the the max-propagation algorithm used by Hugin?
Thank you.

Offline Frank Jensen

  • HUGIN Expert
  • Hero Member
  • *****
  • Posts: 576
    • View Profile
Re: reference for Max-Propagation algorithm
« Reply #1 on: July 02, 2010, 15:46:21 »
Max-propagation was introduced in the following paper:

A. P. Dawid.  Applications of a general propagation algorithm for probabilistic expert systems.  Statistics and Computing, 2(1):25-36, Mar. 1992.

Offline MB

  • Newbie
  • *
  • Posts: 9
    • View Profile
Re: reference for Max-Propagation algorithm
« Reply #2 on: July 17, 2010, 01:08:45 »
Can you please confirm the specific reference for the algorithm Hugin uses?

Furthermore, is it possible to obtain the max configuration for a subset of nodes in the BN?

Offline Frank Jensen

  • HUGIN Expert
  • Hero Member
  • *****
  • Posts: 576
    • View Profile
Re: reference for Max-Propagation algorithm
« Reply #3 on: July 20, 2010, 19:04:01 »
The max-propagation algorithm described in the paper by Dawid is the one used in Hugin.

However, this algorithm can only be used to determine the most probable configuration of all nodes in the network.  If we need to find the most probable configuration of a (proper) subset of the nodes, then we can compute the joint probability distribution of this subset of nodes and search for the most probable configuration.

Hugin also has a Monte Carlo algorithm to determine the most probable configuration(s) of a subset of nodes.  (This algorithm was proposed by Steffen Lauritzen.)   See Section 9.11 of the Hugin API Reference Manual for more details.