Learning causal graphs via nonlinear sufficient dimension reduction
From MaRDI portal
Cites work
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- 10.1162/153244303321897717
- A characterization of Markov equivalence classes for acyclic digraphs
- A general theory for nonlinear sufficient dimension reduction: formulation and estimation
- A linear non-Gaussian acyclic model for causal discovery
- A Nonparametric Graphical Model for Functional Data With Application to Brain Networks Based on fMRI
- A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
- Active learning of causal networks with intervention experiments and optimal designs
- Algorithmic Learning Theory
- Ancestral graph Markov models.
- Bayesian graphical models for multivariate functional data
- CAM: causal additive models, high-dimensional order search and penalized regression
- Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
- Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
- Comment
- Copula Gaussian Graphical Models for Functional Data
- Equivalence and Synthesis of Causal Models
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Estimation of a structural vector autoregression model using non-Gaussianity
- Estimation of causal effects using linear non-Gaussian causal models with hidden variables
- Faithfulness of probability distributions and graphs
- Functional Graphical Models
- Geometry of the faithfulness assumption in causal inference
- High-dimensional consistency in score-based and hybrid structure learning
- scientific article; zbMATH DE number 6378135 (Why is no real title available?)
- scientific article; zbMATH DE number 5957198 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Identifiability of Gaussian structural equation models with equal error variances
- Kernel dimension reduction in regression
- Kernel methods for measuring independence
- Learning causal networks via additive faithfulness
- Linear operator‐based statistical analysis: A useful paradigm for big data
- Measuring and testing dependence by correlation of distances
- Nonlinear sufficient dimension reduction for functional data
- On an additive partial correlation operator and nonparametric estimation of graphical models
- On an additive semigraphoid model for statistical networks with application to pathway analysis
- On principal graphical models with application to gene network
- On the influence of the kernel on the consistency of support vector machines
- PC algorithm for nonparanormal graphical models
- Principal support vector machines for linear and nonlinear sufficient dimension reduction
- Probabilistic graphical models.
- Reconstruction of a directed acyclic graph with intervention
- Sliced Inverse Regression for Dimension Reduction
- Statistical consistency of kernel canonical correlation analysis
- Sufficient dimension reduction: methods and applications with R
- The Adaptive Lasso and Its Oracle Properties
- The max-min hill-climbing Bayesian network structure learning algorithm
- The nonparanormal: semiparametric estimation of high dimensional undirected graphs
- Theoretical foundations of functional data analysis, with an introduction to linear operators
- Universality, Characteristic Kernels and RKHS Embedding of Measures
- Variable Selection via Additive Conditional Independence
This page was built for publication: Learning causal graphs via nonlinear sufficient dimension reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6947064)
