Reversibility and equivalence in directed markov fields

Authors:
T. Kämpke
Affiliations:
Forschungsinstitut für Anwendungsorientierte Wissensverarbeitung (FAW) Helmholtzstr. 16, 89081 Ulm, Germany
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1996

Citing 4
Cited 1

Evaluating influence diagrams

Operations Research
Sequential Model Criticism in Probabilistic Expert Systems

IEEE Transactions on Pattern Analysis and Machine Intelligence
Probability Intervals Over Influence Diagrams

IEEE Transactions on Pattern Analysis and Machine Intelligence
The logic of representing dependencies by directed graphs

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1

Inferencing the graphs of causal Markov fields

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

A directed acyclic graph which underlies a directed Markov field may allow reversals and omissions of arcs without affecting the Markov field. Feasible manipulations of the graph are shown to be related. A construction of the graph starting from scratch is discussed. Also, notions of simplicity are given for approximations of Markov fields.