Causal learning with Occam's razor

DOI10.1007/S11225-018-9829-1MaRDI QIDQ2009770zbMATH OpenOpenAlexWikidataFDO

Authors Oliver Schulte

Publication date 29 November 2019

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11225-018-9829-1

zbMATH Keywords

Bayesian networkformal learning theorycausal graphmind change boundsprobabilistic clauses

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational learning theory (68Q32) Logic in the philosophy of science (03A10)

Recommendations

• scientific article; zbMATH DE number 167417
• A comparison of three Occam's razors for Markovian causal models
• The frugal inference of causal relations
• Causal structure learning: a combinatorial perspective
• A new causal discovery heuristic
• Causality for Machine Learning
• Inductive Logic Programming
• scientific article; zbMATH DE number 1966533

Cites work

• scientific article; zbMATH DE number 1222289 (Why is no real title available?)
• scientific article; zbMATH DE number 1222293 (Why is no real title available?)
• scientific article; zbMATH DE number 1233702 (Why is no real title available?)
• scientific article; zbMATH DE number 1315585 (Why is no real title available?)
• scientific article; zbMATH DE number 1493045 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• scientific article; zbMATH DE number 1439344 (Why is no real title available?)
• 10.1162/153244303321897717
• A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
• Answering queries from context-sensitive probabilistic knowledge bases
• Causation, prediction, and search
• Comparison of identification criteria for machine inductive inference
• Knowledge representation and inference in similarity networks and Bayesian multinets
• Language identification in the limit
• Mind change efficient learning
• Mind change optimal learning of Bayes net structure from dependency and independency data
• The co-discovery of conservation laws and particle families
• The max-min hill-climbing Bayesian network structure learning algorithm
• The topology of statistical verifiability
• Tree induction for probability-based ranking
• Trial and error predicates and the solution to a problem of Mostowski

Cited in

(1)

• scientific article; zbMATH DE number 1931833 (Why is no real title available?)

Describes a project that uses

Uses Software

• TETRAD

This page was built for publication: Causal learning with Occam's razor

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