Incomplete graphical model inference via latent tree aggregation
From MaRDI portal
Publication:5142256
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A classification EM algorithm for clustering and two stochastic versions
- Approximating discrete probability distributions with dependence trees
- Closed-form Bayesian inference of graphical model structures by averaging over trees
- Discussion: Latent variable graphical model selection via convex optimization
- Discussion: Latent variable graphical model selection via convex optimization
- Estimating the dimension of a model
- Knowledge representation and inference in similarity networks and Bayesian multinets
- Latent variable graphical model selection via convex optimization
- Learning latent tree graphical models
- Learning with mixtures of trees.
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Sparse inverse covariance estimation with the graphical lasso
- The correlation space of Gaussian latent tree models and model selection without fitting
Cited in
(2)
This page was built for publication: Incomplete graphical model inference via latent tree aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5142256)