swMATH6072CRANpcalgMaRDI QIDQ18210FDOQ18210
Methods for Graphical Models and Causal Inference
Markus Kalisch, Martin Maechler, Alain Hauser
Last update: 12 February 2024
Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0
Software version identifier: 2.7-8, 0.1-3, 0.1-4, 0.1-5, 0.1-6, 0.1-7, 0.1-8, 0.1-9, 1.0-0, 1.0-2, 1.1-2, 1.1-4, 1.1-5, 1.1-6, 2.0-1, 2.0-2, 2.0-3, 2.0-10, 2.2-0, 2.2-2, 2.2-3, 2.2-4, 2.4-2, 2.4-3, 2.4-5, 2.5-0, 2.6-0, 2.6-2, 2.6-5, 2.6-6, 2.6-7, 2.6-8, 2.6-9, 2.6-10, 2.6-11, 2.6-12, 2.7-0, 2.7-1, 2.7-2, 2.7-3, 2.7-4, 2.7-5, 2.7-6, 2.7-7, 2.7-9, 2.7-10, 2.7-11
Official website: http://cran.r-project.org/web/packages/pcalg/
Source code repository: https://github.com/cran/pcalg
Functions for causal structure learning and causal inference using graphical models. The main algorithms for causal structure learning are PC (for observational data without hidden variables), FCI and RFCI (for observational data with hidden variables), and GIES (for a mix of data from observational studies (i.e. observational data) and data from experiments involving interventions (i.e. interventional data) without hidden variables). For causal inference the IDA algorithm, the Generalized Backdoor Criterion (GBC), the Generalized Adjustment Criterion (GAC) and some related functions are implemented. Functions for incorporating background knowledge are provided.
Cited In (only showing first 100 items - show all)
- Inferring sparse Gaussian graphical models with latent structure
- BCDAG
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- High dimensional sparse covariance estimation via directed acyclic graphs
- Sparse permutation invariant covariance estimation
- Bayesian networks. With examples in R
- Structural intervention distance for evaluating causal graphs
- Concave penalized estimation of sparse Gaussian Bayesian networks
- Partitioned hybrid learning of Bayesian network structures
- Estimating causal structure using conditional DAG models
- ggm
- deal
- gRc
- NETWORKINFERENCE
- GCCA
- corpcor
- graph
- gRbase
- HUGIN
- catnet
- bnlearn
- gRain
- Rgraphviz
- huge
- Separoids
- PleioGRiP
- rbmn
- causaleffect
- reldist
- TETRAD
- SynTReN
- TikzDevice
- BDAGL
- D2C
- gRapHD
- BDgraph
- MXM
- DirectLiNGAM
- RHugin
- dagitty
- Penalized estimation of directed acyclic graphs from discrete data
- CAM
- ParallelPC
- Tigramite
- R/qtl
- Title not available (Why is that?)
- netgwas
- sparsebn
- NESTOR
- GeneNetWeaver
- InvariantCausalPrediction
- GADAG
- NARROMI
- treatSens
- MRPC
- varrank
- PenPC
- MIM
- ssgraph
- CAMERA
- abn
- BiDAG
- rcausal
- BayesNetBP
- RAIcode
- Causal Discovery
- JCI
- Title not available (Why is that?)
- BENEDICT
- trigger
- DREAM4
- micd
- tpc
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- causalDisco
- NetCoupler
- Testing conditional independence in supervised learning algorithms
- eff2
- mDAG
- pcgen
- High-dimensional structure estimation in Ising models: local separation criterion
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- Complete graphical characterization and construction of adjustment sets in Markov equivalence classes of ancestral graphs
- Estimating high-dimensional intervention effects from observational data
- clustNet
- SID
- Uniform random generation of large acyclic digraphs
- Greedy Causal Discovery Is Geometric
- From dependency to causality: a machine learning approach
- Ultra-scalable and efficient methods for hybrid observational and experimental local causal pathway discovery
- Inferring gene regulatory networks by an order independent algorithm using incomplete data sets
- Inferring gene regulatory networks by PCA-CMI using Hill climbing algorithm based on MIT score and SORDER method
- Fast causal orientation learning in directed acyclic graphs
- Learning instrumental variables with structural and non-Gaussianity assumptions
- Efficient Learning of Quadratic Variance Function Directed Acyclic Graphs via Topological Layers
- NlinTS
- Efficient Sampling and Structure Learning of Bayesian Networks
- Copula grow-shrink algorithm for structural learning
This page was built for software: pcalg
