Clustering Without (Thinking About) Triangulation

@inproceedings{Draper1995ClusteringW,
  title={Clustering Without (Thinking About) Triangulation},
  author={Denise Draper},
  booktitle={UAI},
  year={1995}
}
The undirected technique for evaluating belief networks [ Jensen et al., 1990a, Lauritzen and Spiegelhalter, 1988 ] requires clustering the nodes in the network into a junction tree. In the traditional view, the junction tree is constructed from the cliques of the moralized and triangulated belief network: triangulation is taken to be the primitive concept, the goal towards which any clustering algorithm (e.g. node elimination) is directed. In this paper, we present an alternative conception of… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS
Tweets
This paper has been referenced on Twitter 1 time. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 11 references

An efficient algorithm of finding a minimal triangulation of a graph

  • H. Orino.
  • IEEE International Symposium on Circuit !. i and…
  • 1994

Orino . An e  cient algorithm of nding a minimal triangulation of a graph

  • Finn V. Jensen, Frank Jensen
  • IEEE International Symposium on Circuits and…
  • 1994
3 Excerpts

Junction trees and decomposable hypergraphs

  • Finn V. Jensen
  • Research report, Judex Datasystemer, Aalborg,
  • 1988
2 Excerpts