A graphical characterization of the largest chain graphs

Authors:
Martin Volf;Milan Studený
Affiliations:
Czech Technical University Prague, Faculty of Nuclear Sciences and Physical Engineering, Department of Mathematics, Trojanova 13, Prague 12000, Czech Republic;Institute of Information Theory and Automation, Academy of Sciences of Czech Republic, Pod vodárenskou vzí 4, Prague 18208, Czech Republic and Laboratory of Intelligent Systems, Universi ...
Venue:
International Journal of Approximate Reasoning
Year:
1999

Citing 7
Cited 7

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
BIFROST—block recursive models induced from relevant knowledge, observations, and statistical techniques

Computational Statistics & Data Analysis - Special issue dedicated to Toma´sˇ Havra´nek
Chain graphs and symmetric associations

Proceedings of the NATO Advanced Study Institute on Learning in graphical models
Chain graphs: semantics and expressiveness

ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Graphical Models in Applied Multivariate Statistics

Graphical Models in Applied Multivariate Statistics
Chain graphs for learning

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
On separation criterion and recovery algorithm for chain graphs

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

The size distribution for Markov equivalence classes of acyclic digraph models

Artificial Intelligence
Characterization of essential graphs by means of the operation of legal merging of components

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems - New trends in probabilistic graphical models
A Graphical Representation of Equivalence Classes of AMP Chain Graphs

The Journal of Machine Learning Research
The Use of Multilegged Arguments to Increase Confidence in Safety Claims for Software-Based Systems: A Study Based on a BBN Analysis of an Idealized Example

IEEE Transactions on Software Engineering
Parallell interacting MCMC for learning of topologies of graphical models

Data Mining and Knowledge Discovery
Enumerating Markov equivalence classes of acyclic digraph dels

UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Learning causal structures based on markov equivalence class

ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a graphical characterization of the largest chain graphs which serve as unique representatives of classes of Markov equivalent chain graphs. The characterization is a basis for an algorithm constructing, for a given chain graph, the largest chain graph equivalent to it. The algorithm was used to generate a catalog of the largest chain graphs with at most five vertices. Every item of the catalog contains the largest chain graph of a class of Markov equivalent chain graphs and an economical record of the induced independency model.