Learning mixtures of tree graphical models

Advances in Neural Information Processing Systems

Volumn 2, Issue , 2012, Pages 1052-1060

  Anandkumar, Animashree ^a   Hsu, Daniel ^b   Huang, Furong ^a   Kakade, Sham M ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Graphical models; Mixture models; Spectral methods; Tree approximation

Indexed keywords

BOUNDED DEGREE GRAPHS; COMPUTATIONAL REQUIREMENTS; GRAPHICAL MODEL; MARKOV GRAPH; MIXTURE COMPONENTS; MIXTURE MODEL; SPECTRAL METHODS; TREE APPROXIMATION;

FORESTRY; GRAPHIC METHODS; SPEECH RECOGNITION; TREES (MATHEMATICS);

MIXTURES;

FORESTRY; MATHEMATICS; MIXTURES; MODELS; TREES;

EID: 84877767001     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A. Anandkumar, V. Y. F. Tan, F. Huang, and A. S.Willsky. High-Dimensional Structure Learning of Ising Models: Local Separation Criterion. Accepted to Annals of Statistics, Jan. 2012.
2. A. Jalali, C. Johnson, and P. Ravikumar. On learning discrete graphical models using greedy methods. In Proc. of NIPS, 2011.
3. P. Ravikumar, M.J. Wainwright, and J. Lafferty. High-dimensional Ising Model Selection Using l1-Regularized Logistic Regression. Annals of Statistics, 2008.
4. M. Meila and M.I. Jordan. Learning with mixtures of trees. J. of Machine Learning Research, 1:1-48, 2001.
5. P. Spirtes and C. Meek. Learning bayesian networks with discrete variables from data. In Proc. of Intl. Conf. on Knowledge Discovery and Data Mining, pages 294-299, 1995.
6. G. Bresler, E.Mossel, and A. Sly. Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. In Intl. workshop APPROX Approximation, Randomization and Combinatorial Optimization, pages 343-356. Springer, 2008.
7. J.T. Chang. Full reconstruction of markov models on evolutionary trees: identifiability and consistency. Mathematical Biosciences, 137(1):51-73, 1996.
8. E. Mossel and S. Roch. Learning nonsingular phylogenies and hidden Markov models. The Annals of Applied Probability, 16(2):583-614, 2006.
9. A. Anandkumar, D. Hsu, and S.M. Kakade. A Method of Moments for Mixture Models and Hidden Markov Models. In Proc. of Conf. on Learning Theory, June 2012.
10. C. Chow and C. Liu. Approximating Discrete Probability Distributions with Dependence Trees. IEEE Tran. on Information Theory, 14(3):462-467, 1968.
11. N. Meinshausen and P. Bühlmann. High Dimensional Graphs and Variable Selection With the Lasso. Annals of Statistics, 34(3):1436-1462, 2006.
12. M. Belkin and K. Sinha. Polynomial learning of distribution families. In IEEE Annual Symposium on Foundations of Computer Science, pages 103-112, 2010.
13. A. Moitra and G. Valiant. Settling the polynomial learnability of mixtures of gaussians. In IEEE Annual Symposium on Foundations of Computer Science, 2010.
14. S.L. Lauritzen. Graphical models: Clarendon Press. Clarendon Press, 1996.
15. A. Anandkumar, D. Hsu, and S.M. Kakade. Learning High-Dimensional Mixtures of Graphical Models. Preprint. Available on ArXiv:1203.0697, Feb. 2012.
16. V.Y.F. Tan, A. Anandkumar, and A. Willsky. A Large-Deviation Analysis for the Maximum Likelihood Learning of Tree Structures. IEEE Tran. on Information Theory, 57(3):1714-1735, March 2011.