An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm

DOI10.1007/978-3-030-87626-5_21zbMATH Open1519.68224MaRDI QIDQ6488142FDOQ6488142

Authors: Marcel Wienöbst, Maciej Liśkiewicz 

Publication date: 29 March 2023

Recommendations

• Order-independent constraint-based causal structure learning
• Evaluation of Rules for Coping with Insufficient Data in Constraint-Based Search Algorithms
• PC algorithm for nonparanormal graphical models
• The reduced PC-algorithm: improved causal structure learning in large random networks
• Towards a fast and efficient algorithm for learning Bayesian network

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Cites Work

• Causation, prediction, and search
• A characterization of Markov equivalence classes for acyclic digraphs
• Estimating high-dimensional directed acyclic graphs with the PC-algorithm
• Causality. Models, reasoning, and inference
• PARTIAL CORRELATION AND CONDITIONAL CORRELATION AS MEASURES OF CONDITIONAL INDEPENDENCE
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• PC algorithm for nonparanormal graphical models
• The reduced PC-algorithm: improved causal structure learning in large random networks

Cited In (1)

• Order-independent constraint-based causal structure learning

This page was built for publication: An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488142)