Chain Graphs for Learning

Abstract

Chain graphs combine directed and undi­ rected graphs and their underlying mathe­ matics combines properties of the two. This paper gives a simplified definition of chain graphs based on a hierarchical combination of Bayesian (directed) and Markov (undirected) networks. Examples of a chain graph are multivariate feed-forward networks, cluster­ ing with conditional interaction between vari­ ables, and forms of Bayes classifiers. Chain graphs are then extended using the notation of plates so that samples and data analysis problems can be represented in a graphical model as well. Implications for learning are discussed in the conclusion.

Cite

Text

Buntine. "Chain Graphs for Learning." Conference on Uncertainty in Artificial Intelligence, 1995.

Markdown

[Buntine. "Chain Graphs for Learning." Conference on Uncertainty in Artificial Intelligence, 1995.](https://mlanthology.org/uai/1995/buntine1995uai-chain/)

BibTeX

@inproceedings{buntine1995uai-chain,
  title     = {{Chain Graphs for Learning}},
  author    = {Buntine, Wray L.},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1995},
  pages     = {46-54},
  url       = {https://mlanthology.org/uai/1995/buntine1995uai-chain/}
}