A focused information criterion for graphical models in fMRI connectivity with high-dimensional data

DOI10.1214/15-AOAS882zbMath1397.62466OpenAlexW2231639259MaRDI QIDQ262408

Eugen Pircalabelu, Sara Jahfari, Lourens J. Waldorp, Gerda Claeskens

Publication date: 29 March 2016

Published in: The Annals of Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.aoas/1453994197

zbMATH Keywords

penalizationmodel selectionhigh-dimensional datafocused information criterionGaussian graphical modelfMRI connectivity

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of graph theory (05C90) Biomedical imaging and signal processing (92C55) Statistical aspects of information-theoretic topics (62B10)

Related Items

Sparse graphical models via calibrated concave convex procedure with application to fMRI data, A High‐dimensional Focused Information Criterion, A Bayesian Approach for Estimating Dynamic Functional Network Connectivity in fMRI Data

Uses Software

• FLIRT
• glasso
• huge
• camel
• BDgraph
• Connectome Viewer Toolkit
• BET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse inverse covariance estimation with the graphical lasso
• The Adaptive Lasso and Its Oracle Properties
• Bayesian structure learning in sparse Gaussian graphical models
• Statistical significance in high-dimensional linear models
• A mixed L2 norm regularized HRF estimation method for rapid event-related fMRI experiments
• Statistics for high-dimensional data. Methods, theory and applications.
• An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
• The statistical analysis of fMRI data
• One-step sparse estimates in nonconcave penalized likelihood models
• Estimating time-varying networks
• Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
• The graphical lasso: new insights and alternatives
• Time varying undirected graphs
• Network exploration via the adaptive LASSO and SCAD penalties
• Focused information criterion and model averaging for generalized additive partial linear models
• High-dimensional graphs and variable selection with the Lasso
• Variable selection using MM algorithms
• A Constrainedℓ₁Minimization Approach to Sparse Precision Matrix Estimation
• The EM Algorithm and Extensions, 2E
• Model selection and estimation in the Gaussian graphical model
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• The Focused Information Criterion
• Maximum Likelihood Computations with Repeated Measures: Application of the EM Algorithm
• Regularization and Variable Selection Via the Elastic Net
• The huge Package for High-dimensional Undirected Graph Estimation in R
• A focused information criterion for graphical models