Thin Junction Trees

@inproceedings{Bach2001ThinJT,
  title={Thin Junction Trees},
  author={Francis R. Bach and Michael I. Jordan},
  booktitle={NIPS},
  year={2001}
}
We present an algorithm that induces a class of models with thin junction trees—models that are characterized by an upper bound on the size o f the maximal cliques of their triangulated graph. By ensurin g that the junction tree is thin, inference in our models remains tract able throughout the learning process. This allows both an efficient implemen tation of an iterative scaling parameter estimation algorithm and al so ensures that inference can be performed efficiently with the final model… CONTINUE READING
Highly Cited
This paper has 133 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 96 extracted citations

134 Citations

051015'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 134 citations based on the available data.

See our FAQ for additional information.

References

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

Similar Papers

Loading similar papers…