Gradient directed regularization for sparse Gaussian concentration graphs, with applications to inference of genetic networks
From MaRDI portal
Publication:3434147
DOI10.1093/BIOSTATISTICS/KXJ008zbMath1169.62378OpenAlexW2125129404WikidataQ51958890 ScholiaQ51958890MaRDI QIDQ3434147
Publication date: 23 April 2007
Published in: Biostatistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biostatistics/kxj008
Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of graph theory (05C90) Empirical decision procedures; empirical Bayes procedures (62C12)
Related Items (32)
Node-structured integrative Gaussian graphical model guided by pathway information ⋮ Confidence intervals for heritability via Haseman-Elston regression ⋮ Learning local directed acyclic graphs based on multivariate time series data ⋮ Adjusting for high-dimensional covariates in sparse precision matrix estimation by \(\ell_1\)-penalization ⋮ Assessment of Covariance Selection Methods in High-Dimensional Gaussian Graphical Models ⋮ Comparing dependent undirected Gaussian networks ⋮ Model selection and estimation in the matrix normal graphical model ⋮ A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems ⋮ Estimating networks with jumps ⋮ Bootstrap inference for network construction with an application to a breast cancer microarray study ⋮ Multiple testing and error control in Gaussian graphical model selection ⋮ Universal construction mechanism for networks from one-dimensional symbol sequences ⋮ MARS as an alternative approach of Gaussian graphical model for biochemical networks ⋮ Variable selection and dependency networks for genomewide data ⋮ An efficient method for identifying statistical interactors in gene association networks ⋮ Learning Oncogenic Pathways from Binary Genomic Instability Data ⋮ Regularized Parameter Estimation in High-Dimensional Gaussian Mixture Models ⋮ Robust Gaussian Graphical Modeling Via l1 Penalization ⋮ Likelihood-Based Selection and Sharp Parameter Estimation ⋮ Shrinkage tuning parameter selection in precision matrices estimation ⋮ Review on statistical methods for gene network reconstruction using expression data ⋮ A Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models ⋮ A sparse conditional Gaussian graphical model for analysis of genetical genomics data ⋮ Network exploration via the adaptive LASSO and SCAD penalties ⋮ Network modeling in biology: statistical methods for gene and brain networks ⋮ An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation ⋮ Regularized rank-based estimation of high-dimensional nonparanormal graphical models ⋮ Estimating heterogeneous graphical models for discrete data with an application to roll call voting ⋮ Effectiveness of combinations of Gaussian graphical models for model building ⋮ A computationally fast alternative to cross-validation in penalized Gaussian graphical models ⋮ Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints ⋮ An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems
This page was built for publication: Gradient directed regularization for sparse Gaussian concentration graphs, with applications to inference of genetic networks
