Integrative learning of linear non-Gaussian directed acyclic graphs with application on multisource gene regulatory network analysis
From MaRDI portal
Cites work
- 10.1162/153244303321897717
- \(\mathsf{PenPC}\): a two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs
- A fast unified algorithm for solving group-lasso penalize learning problems
- A note on the Lasso and related procedures in model selection
- Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
- DirectLiNGAM: a direct method for learning a linear non-Gaussian structural equation model
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Exact estimation of multiple directed acyclic graphs
- Gaussian graphical model estimation with false discovery rate control
- High-dimensional causal discovery under non-Gaussianity
- High-dimensional graphs and variable selection with the Lasso
- High-dimensional joint estimation of multiple directed Gaussian graphical models
- High-dimensional learning of linear causal networks via inverse covariance estimation
- scientific article; zbMATH DE number 7625154 (Why is no real title available?)
- Identifiability of Gaussian linear structural equation models with homogeneous and heterogeneous error variances
- Identifiability of Gaussian structural equation models with equal error variances
- Individual Data Protected Integrative Regression Analysis of High-Dimensional Heterogeneous Data
- Joint skeleton estimation of multiple directed acyclic graphs for heterogeneous population
- Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach
- Measuring and testing dependence by correlation of distances
- Model Selection and Estimation in Regression with Grouped Variables
- Targeted fused ridge estimation of inverse covariance matrices from multiple high-dimensional data classes
- The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
- The max-min hill-climbing Bayesian network structure learning algorithm
This page was built for publication: Integrative learning of linear non-Gaussian directed acyclic graphs with application on multisource gene regulatory network analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835661)