Structure learning of undirected graphical models for count data.
From MaRDI portal
Recommendations
- A conditional independence algorithm for learning undirected graphical models
- Bayesian structure learning in sparse Gaussian graphical models
- PC algorithm for nonparanormal graphical models
- scientific article; zbMATH DE number 7306910
- The reduced PC-algorithm: improved causal structure learning in large random networks
Cites work
- scientific article; zbMATH DE number 3984308 (Why is no real title available?)
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- Asymptotic Statistics
- Causation, prediction, and search
- Eigenvalue inequalities for principal submatrices
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
- Graphical models via univariate exponential family distributions
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- High-dimensional graphs and variable selection with the Lasso
- Order-independent constraint-based causal structure learning
- Partial correlation estimation by joint sparse regression models
- Poisson dependency networks: gradient boosted models for multivariate count data
- Probability Inequalities for Sums of Bounded Random Variables
- Sparse inverse covariance estimation with the graphical lasso
- The nonparanormal: semiparametric estimation of high dimensional undirected graphs
Cited in
(3)
This page was built for publication: Structure learning of undirected graphical models for count data.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4998942)
