Is the clustering algorithm eqivalent to the HUGIN junction tree?
Is the clustering algorithm eqivalent to the HUGIN junction tree?
Is the default inference algorithm "clustering algorithm" the socalled HUGIN junction tree algorithm? or Shafershenoy tree algorithm?

 Site Admin
 Posts: 264
 Joined: Tue Dec 11, 2007 4:24 pm
Re: Is the clustering algorithm eqivalent to the HUGIN junction tree?
SMILE's clustering algorithm is a variation on LauritzenSpiegelhalter's junction tree algorithm. It is a variation and, as you may have noticed, it is very very fast. It is a result of combining good ideas with good engineering.
Cheers,
Marek
Cheers,
Marek
Re: Is the clustering algorithm eqivalent to the HUGIN junction tree?
Hi Merek,
Could you please give us some relevant materials on the specific inference process? I found the following paper would be useful if anyone is interested.
Lepar V, Shenoy P P. A comparison of LauritzenSpiegelhalter, Hugin, and ShenoyShafer architectures for computing marginals of probability distributions[J]. arXiv preprint arXiv:1301.7394, 2013.
Thank you very much!
John
Could you please give us some relevant materials on the specific inference process? I found the following paper would be useful if anyone is interested.
Lepar V, Shenoy P P. A comparison of LauritzenSpiegelhalter, Hugin, and ShenoyShafer architectures for computing marginals of probability distributions[J]. arXiv preprint arXiv:1301.7394, 2013.
Thank you very much!
John

 Site Admin
 Posts: 264
 Joined: Tue Dec 11, 2007 4:24 pm
Re: Is the clustering algorithm eqivalent to the HUGIN junction tree?
It took us over twenty years to implement the fastest and most reliable version of the clustering algorithm there is. Do you mean you would like us to disclose the details of this implementation :)? As I wrote before, it is good theory, most of which has been published in the literature, and great engineering.
Marek
Marek