Unfolding latent tree structures using 4th order tensors

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 2, 2013, Pages 1353-1361

  Ishteva, Mariya ^a   Park, Haesun ^b   Song, Le ^b  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORESTRY; LEARNING SYSTEMS; PROBABILITY; TREES (MATHEMATICS);

CONDITIONAL INDEPENDENCES; DIVIDE-AND-CONQUER ALGORITHM; ERROR PROBABILITIES; HIDDEN STATE; LATENT VARIABLE MODELS; LEARNING TASKS; MARGINAL DISTRIBUTION; TREE STRUCTURES;

TENSORS;

ALGORITHMS; FORESTRY; MATHEMATICS; PROBABILITY; TREES;

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

References (27)

1. Allman, E. S. and Rhodes, J. A. The identifiability of tree topology for phylogenetic models, including covarion and mixture models. Journal of Computational Biology, 13(5):1101-1113, 2006. (Pubitemid 43993453)
2. Anandkumar, A., Chaudhuri, K., Hsu, D., Kakade, S., Song, L., and Zhang, T. Spectral methods for learning multivariate latent tree structure. In Neural Information Processing Systems, 2011.
3. Buneman, P. The recovery of trees from measures of dissimilarity. In Hodson, F.R., Kendall, D.G., and Tautu, P. (eds.), Mathematics in the archaeological and historical sciences, pp. 387-395. Edinburgh University Press, 1971.
4. Carroll, J. and Chang, J. Analysis of individual differences in multidimensional scaling via an N-way generalization of "Eckart-Young" decomposition. Psychometrika, 35(3):283-319, 1970.
5. Choi, M., Tan, V., Anandkumar, A., and Willsky, A. Learning latent tree graphical models. Journal of Machine Learning Research, 12:1771-1812, 2011.
6. Chow, C., and Liu, C. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14:462-467, 1968.
7. Erdös, P. L., Székely, L. A., Steel, M. A., and Warnow., T. J. A few logs suffice to build (almost) all trees: Part II. Theoretical Computer Science, 221:77-118, 1999.
8. Eriksson, N. Tree construction using singular value decomposition. In Pachter, L. and Sturmfels, B. (eds.), Algebraic Statistics for Computational Biology, pp. 347-358. Cambridge University Press, 2005. URL http://dx.doi.org/ 10.1017/CBO9780511610684.
9. Fazel, Maryam, Hindi, Haitham, and Boyd, Stephen P. A rank minimization heuristic with application to minimum order system approximation. In American Control Conference, pp. 4734-4739, 2001.
10. Grasedyck, L. Hierarchical singular value decomposition of tensors. SIAM J. Matrix Anal. Appl., 31(4): 2029-2054, 2010.
11. Gretton, A., Bousquet, O., Smola, A. J., and Schölkopf, B. Measuring statistical dependence with Hilbert-Schmidt norms. In Jain, S., Simon, H. U., and Tomita, E. (eds.), Proceedings of the International Conference on Algorithmic Learning Theory, pp. 63-77. Springer-Verlag, 2005a.
12. Gretton, A., Herbrich, R., Smola, A. J., Bousquet, O., and Schölkopf, B. Kernel methods for measuring independence. Journal of Machine Learning Research, 6:2075-2129, 2005b. (Pubitemid 41798124)
13. Harmeling, S. and Williams, C. Greedy learning of binary latent trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1087-1097, 2010.
14. Harshman, R. A. Foundations of the PARAFAC procedure: Model and conditions for an "explanatory" multi-mode factor analysis. UCLA Working Papers in Phonetics, 16(1):1-84, 1970.
15. Heller, K. A. and Ghahramani, Z. Bayesian hierarchical clustering. In Proceedings of the International Conference on Machine Learning, pp. 297-304, 2005.
16. Lake, J.A. Reconstructing evolutionary trees from dna and protein sequences: paralinear distances. Proceedings of the National Academy of Sciences, 91 (4):1455, 1994.
17. Mihaescu, R., Levy, D., and Pachter, L. Why neighbor-joining works. Algorithmica, 54(1):1-24, 2009.
18. Oseledets, I. V. Tensor-train decomposition. SIAM Journal on Scientific Computing, 33:2295-2317, 2011.
19. Parikh, A., Song, L., and Xing, E. P. A spectral algorithm for latent tree graphical models. In Proceedings of the International Conference on Machine Learning, 2011.
20. Pearl, J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufman, 1988.
21. Pearl, J. and Tarsi, M. Structuring causal trees. Journal of Complexity, 2(1):60-77, 1986.
22. Robinson, D.F. and Foulds, L.R. Comparison of phylogenetic trees. Mathematical Biosciences, 53(1-2): 131-147, 1981. (Pubitemid 11129084)
23. Rosasco, L., Belkin, M., and Vito, E.D. On learning with integral operators. Journal of Machine Learning Research, 11:905-934, 2010.
24. Saitou, N. and Nei, M. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4(4):406-425, 1987.
25. Semple, C. and Steel, M.A. Phylogenetics, volume 24. Oxford University Press, USA, 2003.
26. Teh, Yee Whye, Daume, Hal, and Roy, Daniel. Bayesian agglomerative clustering with coalescents. In Advances in Neural Information Processing Systems 22, 2008.
27. Zhang, N. L. Hierarchical latent class models for cluster analysis. Journal of Machine Learning Research, 5:697-723, 2004.