TETRAD

swMATH12177MaRDI QIDQ24108FDOQ24108

Author name not available (Why is that?)

Source code repository: https://github.com/cmu-phil/tetrad

Described by source

• Causation, prediction, and search

Cited In (only showing first 100 items - show all)

• Causal graphs: addressing the confounding problem without instruments or ignorability
• A uniformly consistent estimator of causal effects under the \(k\)-triangle-faithfulness assumption
• External validity: from do-calculus to transportability across populations
• Self-regularized causal structure discovery for trajectory-based networks
• Discussion of big Bayes stories and BayesBag
• Geometry of the faithfulness assumption in causal inference
• Intervention, determinism, and the causal minimality condition
• Learning causal Bayesian networks using minimum free energy principle
• Foundations of probability
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• High dimensional sparse covariance estimation via directed acyclic graphs
• Diagrammatic Definitions of Causal Claims
• Causality analysis of futures sugar prices in Zhengzhou based on graphical models for multivariate time series
• Searching multiregression dynamic models of resting-state fMRI networks using integer programming
• Granger causality and path diagrams for multivariate time series
• The Libra toolkit for probabilistic models
• Invariant causal prediction for sequential data
• Bayesian networks for discrete multivariate data: An algebraic approach to inference
• Sparse directed acyclic graphs incorporating the covariates
• Structural intervention distance for evaluating causal graphs
• Causal inference in statistics: an overview
• A focused information criterion for graphical models
• A hybrid random field model for scalable statistical learning
• Three centuries of categorical data analysis: Log-linear models and maximum likelihood estima\-tion
• Invariance, causality and robustness
• Partitioned hybrid learning of Bayesian network structures
• On Granger causality and the effect of interventions in time series
• Markov equivalence for ancestral graphs
• Book review of: S. A. Mulaik, Linear causal modeling with structural equations
• Algebraic factor analysis: tetrads, pentads and beyond
• Choice as an alternative to control in observational studies. (With comments and a rejoinder).
• Acyclic directed graphs representing independence models
• Induced dependence, factor interaction, and discriminating between causal structures
• High-dimensional joint estimation of multiple directed Gaussian graphical models
• Recent developments in parameter estimation and structure identification of biochemical and genomic systems
• Graphoid properties of epistemic irrelevance and independence
• Causal discovery through MAP selection of stratified chain event graphs
• Learning Bayesian networks from data: An information-theory based approach
• Causal inference for complex longitudinal data: the continuous case.
• Knowledge representation and inference in similarity networks and Bayesian multinets
• Bayesian network learning algorithms using structural restrictions
• Estimating causal structure using conditional DAG models
• On the definition of a confounder
• Penalized estimation of directed acyclic graphs from discrete data
• Learning Causal Bayesian Networks from Observations and Experiments: A Decision Theoretic Approach
• Conditional independence and chain event graphs
• Star graphs induce tetrad correlations: for Gaussian as well as for binary variables
• Title not available (Why is that?)
• A SINful approach to Gaussian graphical model selection
• The Hardness of Conditional Independence Testing and the Generalised Covariance Measure
• Maximum Likelihood Estimation Over Directed Acyclic Gaussian Graphs
• On the network topology of variance decompositions: measuring the connectedness of financial firms
• Multiple testing and error control in Gaussian graphical model selection
• \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
• Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
• A hybrid methodology for learning belief networks: BENEDICT
• Learning mixtures of truncated basis functions from data
• Structural learning and estimation of joint causal effects among network-dependent variables
• Testing conditional independence in supervised learning algorithms
• Global identifiability of linear structural equation models
• Half-trek criterion for generic identifiability of linear structural equation models
• High-dimensional variable selection
• The max-min hill-climbing Bayesian network structure learning algorithm
• Graphical models for inference under outcome-dependent sampling
• Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
• Causation entropy from symbolic representations of dynamical systems
• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
• Causal graphical models in systems genetics: a unified framework for joint inference of causal network and genetic architecture for correlated phenotypes
• Probability distributions with summary graph structure
• Likelihood ratio tests and singularities
• Distributional equivalence and structure learning for bow-free acyclic path diagrams
• Chain Graph Models and their Causal Interpretations
• Inferring large graphs using \(\ell_1\)-penalized likelihood
• Complete graphical characterization and construction of adjustment sets in Markov equivalence classes of ancestral graphs
• To explain or to predict?
• Trek separation for Gaussian graphical models
• Causal analysis with chain event graphs
• Estimating high-dimensional intervention effects from observational data
• Simple strategies for semi-supervised feature selection
• Computing lower and upper expectations under epistemic independence
• Propensities and probabilities
• The logic of Simpson's paradox
• Moments of minors of Wishart matrices
• A conditional independence algorithm for learning undirected graphical models
• Graphical models for imprecise probabilities
• Towards scalable and data efficient learning of Markov boundaries
• The lesson of causal discovery algorithms for quantum correlations: causal explanations of Bell-inequality violations require fine-tuning
• Structural learning about directed acyclic graphs from multiple databases
• Decomposition of structural learning about directed acyclic graphs
• Are Newcomb problems really decisions?
• An efficient Bayesian network structure learning strategy
• Bounds on average controlled direct effects with an unobserved response variable
• Identification, estimation and approximation of risk under interventions that depend on the natural value of treatment using observational data
• Classification using hierarchical Naïve Bayes models
• Markovian acyclic directed mixed graphs for discrete data
• Inference of structures of models of probabilistic dependences from statistical data
• Comment: Complex causal questions require careful model formulation: Discussion of Rubin on experiments with ``censoring due to death
• Towards a fast and efficient algorithm for learning Bayesian network
• Identification of vector AR models with recursive structural errors using conditional independence graphs
• Bayesian selection of graphical regulatory models

This page was built for software: TETRAD