Sparse nonparametric graphical models
From MaRDI portal
Publication:5965307
Abstract: We present some nonparametric methods for graphical modeling. In the discrete case, where the data are binary or drawn from a finite alphabet, Markov random fields are already essentially nonparametric, since the cliques can take only a finite number of values. Continuous data are different. The Gaussian graphical model is the standard parametric model for continuous data, but it makes distributional assumptions that are often unrealistic. We discuss two approaches to building more flexible graphical models. One allows arbitrary graphs and a nonparametric extension of the Gaussian; the other uses kernel density estimation and restricts the graphs to trees and forests. Examples of both methods are presented. We also discuss possible future research directions for nonparametric graphical modeling.
Recommendations
- Sparse Matrix Graphical Models
- Sparse Gaussian graphical mixture model
- Nonparametric graphical models
- Inferring sparse Gaussian graphical models with latent structure
- Robust sparse Gaussian graphical modeling
- Sparse Gaussian graphical model estimation via alternating minimization
- Fitting very large sparse Gaussian graphical models
- Bayesian structure learning in sparse Gaussian graphical models
- Bayesian model selection with graph structured sparsity
- Graphical models for sparse data: graphical Gaussian models with vertex and edge symmetries
Cites work
- scientific article; zbMATH DE number 3163305 (Why is no real title available?)
- All of Nonparametric Statistics
- An effective method for high-dimensional log-density ANOVA estimation, with application to nonparametric graphical model building
- Approximating discrete probability distributions with dependence trees
- Estimating time-varying networks
- Forest density estimation
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- High-dimensional graphs and variable selection with the Lasso
- High-dimensional semiparametric Gaussian copula graphical models
- Learning latent tree graphical models
- Model selection and estimation in the Gaussian graphical model
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Rates of strong uniform consistency for multivariate kernel density estimators. (Vitesse de convergence uniforme presque sûre pour des estimateurs à noyaux de densités multivariées)
- Rejoinder: Latent variable graphical model selection via convex optimization
- Rodeo: Sparse, greedy nonparametric regression
- Sparse inverse covariance estimation with the graphical lasso
- Sparse permutation invariant covariance estimation
- The nonparanormal: semiparametric estimation of high dimensional undirected graphs
Cited in
(26)- Model selection for Markov random fields on graphs under a mixing condition
- Nonparametric graphical models
- On the non-local priors for sparsity selection in high-dimensional Gaussian DAG models
- Joint estimation of sparse multivariate regression and conditional graphical models
- Optimal couplings between sparse block models
- Estimation of graphical models: an overview of selected topics
- Kernel-based hybrid random fields for nonparametric density estimation
- Model free estimation of graphical model using gene expression data
- Sparse directed acyclic graphs incorporating the covariates
- An overview of heavy-tail extensions of multivariate Gaussian distribution and their relations
- Introduction to the special issue on sparsity and regularization methods
- Robust Time-Varying Undirected Graphs
- Robust sparse Gaussian graphical modeling
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- scientific article; zbMATH DE number 7306910 (Why is no real title available?)
- On estimation of the diagonal elements of a sparse precision matrix
- Inferring sparse Gaussian graphical models with latent structure
- Sparse Matrix Graphical Models
- Structure recovery for partially observed discrete Markov random fields on graphs under not necessarily positive distributions
- Multivariate sparse Laplacian shrinkage for joint estimation of two graphical structures
- scientific article; zbMATH DE number 7306885 (Why is no real title available?)
- Concentration inequalities for empirical processes of linear time series
- Sparse Gaussian graphical mixture model
- Change-point computation for large graphical models: a scalable algorithm for Gaussian graphical models with change-points
- Structural similarity and difference testing on multiple sparse Gaussian graphical models
- Forest density estimation
This page was built for publication: Sparse nonparametric graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5965307)
