Learning Latent Tree Graphical Models

zbMath1280.68160arXiv1009.2722MaRDI QIDQ5396658

Alan S. Willsky, Animashree Anandkumar, Myung Jin Choi, Vincent Y. F. Tan

Publication date: 3 February 2014

Full work available at URL: https://arxiv.org/abs/1009.2722

zbMATH Keywords

graphical modelsMarkov random fieldsstructure learninghidden variableslatent tree models

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Learning and adaptive systems in artificial intelligence (68T05) Contingency tables (62H17) Graphical methods in statistics (62A09)

Related Items

Learning loopy graphical models with latent variables: efficient methods and guarantees, Latent tree models for hierarchical topic detection, Learning Gaussian graphical models with latent confounders, UC-LTM: unidimensional clustering using latent tree models for discrete data, Identifiability of Hierarchical Latent Attribute Models, Identifiability in robust estimation of tree structured models, Learning Minimal Latent Directed Information Polytrees, Incomplete graphical model inference via latent tree aggregation, Phase transition in the sample complexity of likelihood-based phylogeny inference, High-dimensional structure estimation in Ising models: local separation criterion, Greedy learning of latent tree models for multidimensional clustering, Sparse nonparametric graphical models, Sum-product graphical models, Maximum likelihood estimation in Gaussian models under total positivity, Estimating heterogeneous gene regulatory networks from zero-inflated single-cell expression data, Spectral Neighbor Joining for Reconstruction of Latent Tree Models