Skip to main content

A Study of Recently Discovered Equalities about Latent Tree Models Using Inverse Edges

  • Conference paper
Probabilistic Graphical Models (PGM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8754))

Included in the following conference series:

  • 2054 Accesses

Abstract

Interesting equalities have recently been discovered about latent tree models. They relate distributions of two or three observed variables with joint distributions of four or more observed variables, and with model parameters that depend on latent variables. The equations are derived by using matrix and tensor decompositions. This paper sheds new light on the equalities by offering an alternative derivation in terms of variable elimination and structure manipulations. The key technique is the introduction of inverse edges.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anandkumar, A., Ge, R., Hsu, D., Kakade, S.M., Telgarsky, M.: Tensor Decompositions for Learning Latent Variable Models (2012) (Preprint)

    Google Scholar 

  2. Anandkumar, A., Hsu, D., Kakade, S.M.: A Method of Moments for Mixture Models and Hidden Markov Models. In: An Abridged Version Appears in the Proc. of COLT (2012)

    Google Scholar 

  3. Bartholomew, D.J., Knott, M., Moustaki, I.: Latent variable models and factor analysis, 2nd edn. Wiley (1999)

    Google Scholar 

  4. Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society, Series B 39, 1–38 (1977)

    MathSciNet  MATH  Google Scholar 

  5. Hsu, D., Kakade, S., Zhang, T.: A spectral algorithm for learning hidden markov models. In: COLT (2009)

    Google Scholar 

  6. Lauritzen, S.L.: Graphical Models. Clarendon Press (1996)

    Google Scholar 

  7. Mossel, E., Roch, S.: Learning nonsingular phylogenies and hidden markov models. AOAP 16, 583–614 (2006)

    MathSciNet  MATH  Google Scholar 

  8. Mourad, R., Sinoquet, C., Zhang, N.L., Liu, T.F., Leray, P.: A survey on latent tree models and applications. Journal of Artificial Intelligence Research 47, 157–203 (2013)

    MathSciNet  MATH  Google Scholar 

  9. Murphy, K.P.: Machine learning: a probabilistic perspective. MIT Press (2012)

    Google Scholar 

  10. Parikh, A.P., Song, L., Xing, E.P.: A Spectral Algorithm for Latent Tree Graphical Models. In: ICML (2011)

    Google Scholar 

  11. Zhang, N.L.: Hierarchical latent class models for cluster analysis. Journal of Machine Learning Research 5, 697–723 (2004)

    MATH  Google Scholar 

  12. Zhang, N.L., Poole, D.: Exploiting causal independence in Bayesian network inference. Journal of Artificial Intelligence Research 5, 301–328 (1996)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, N.L., Wang, X., Chen, P. (2014). A Study of Recently Discovered Equalities about Latent Tree Models Using Inverse Edges. In: van der Gaag, L.C., Feelders, A.J. (eds) Probabilistic Graphical Models. PGM 2014. Lecture Notes in Computer Science(), vol 8754. Springer, Cham. https://doi.org/10.1007/978-3-319-11433-0_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11433-0_37

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11432-3

  • Online ISBN: 978-3-319-11433-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics