A scoring criterion for learning chain graphs

DOI10.1007/s10114-005-0651-0zbMath1102.62005OpenAlexW2086081161MaRDI QIDQ2508629

Zhongguo Zheng, Jing Xu, Xing-wei Tong

Publication date: 13 October 2006

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-005-0651-0

zbMATH Keywords

conditional independenceMarkov equivalence

Mathematics Subject Classification ID

Multivariate analysis (62H99) Applications of graph theory (05C90) Foundations and philosophical topics in statistics (62A01) Statistical aspects of information-theoretic topics (62B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic complexity and modeling
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Estimating the dimension of a model
• A graphical characterization of the largest chain graphs
• A recovery algorithm for chain graphs
• Learning Bayesian networks: The combination of knowledge and statistical data
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• Chain Graph Models and their Causal Interpretations
• A new look at the statistical model identification

This page was built for publication: A scoring criterion for learning chain graphs