The reduced PC-algorithm: improved causal structure learning in large random networks
From MaRDI portal
Recommendations
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- High-dimensional learning of linear causal networks via inverse covariance estimation
- Learning high-dimensional Gaussian linear structural equation models with heterogeneous error variances
- Order-independent constraint-based causal structure learning
- Learning causal networks via additive faithfulness
Cites work
- \(\mathsf{PenPC}\): a two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs
- A critical point for random graphs with a given degree sequence
- Causation, prediction, and search
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Geometry of the faithfulness assumption in causal inference
- Graph estimation with joint additive models
- High-dimensional consistency in score-based and hybrid structure learning
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- High-dimensional Gaussian graphical model selection: walk summability and local separation criterion
- High-dimensional learning of linear causal networks via inverse covariance estimation
- scientific article; zbMATH DE number 6378135 (Why is no real title available?)
- scientific article; zbMATH DE number 5957391 (Why is no real title available?)
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Random graph dynamics
- The max-min hill-climbing Bayesian network structure learning algorithm
- The small-world phenomenon: an algorithmic perspective
- Trek separation for Gaussian graphical models
Cited in
(18)- A fast iterative algorithm for high-dimensional differential network
- Efficient identification of independence networks using mutual information
- \(\mathsf{PenPC}\): a two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs
- High-dimensional learning of linear causal networks via inverse covariance estimation
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Learning causal networks via additive faithfulness
- Identifiability of additive noise models using conditional variances
- Structure learning of undirected graphical models for count data.
- Learning a high-dimensional linear structural equation model via _1-regularized regression
- Consistent causal inference from time series with PC algorithm and its time-aware extension
- Causal Structural Learning via Local Graphs
- Densely connected sub-Gaussian linear structural equation model learning via \(\ell_1\)- and \(\ell_2\)-regularized regressions
- The dual PC algorithm and the role of Gaussianity for structure learning of Bayesian networks
- Nonlinear directed acyclic graph estimation based on the kernel partial correlation coefficient
- An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm
- Post-selection inference for causal effects after causal discovery
- Compositional data graphical model learning based on conditional independence measurement
- Weak equivalence of local independence graphs
This page was built for publication: The reduced PC-algorithm: improved causal structure learning in large random networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214260)
