Effectiveness of combinations of Gaussian graphical models for model building
From MaRDI portal
Publication:5218890
Recommendations
Cites work
- scientific article; zbMATH DE number 4211299 (Why is no real title available?)
- scientific article; zbMATH DE number 469396 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Model Selection Procedure for Large Families of Models
- A fast procedure for model search in multidimensional contingency tables
- A new look at the statistical model identification
- A robust procedure for Gaussian graphical model search from microarray data with \(p\) larger than \(n\)
- Combining statistical models
- Cross-study validation and combined analysis of gene expression microarray data
- Estimating the dimension of a model
- Gradient directed regularization for sparse Gaussian concentration graphs, with applications to inference of genetic networks
- High-dimensional graphs and variable selection with the Lasso
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Introduction to Graphical Modelling
- Marginalization and collapsibility in graphical interaction models
- Model selection and estimation in the Gaussian graphical model
- Model selection for Gaussian concentration graphs
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Multiple testing and error control in Gaussian graphical model selection
- Simultaneous Test Procedures--Some Theory of Multiple Comparisons
- Sparse inverse covariance estimation with the graphical lasso
Cited in
(3)
This page was built for publication: Effectiveness of combinations of Gaussian graphical models for model building
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5218890)