Algorithms for learning decomposable models and chordal graphs

Authors:
Luis M. de Campos;Juan F. Huete
Affiliations:
Departamento de Ciencias de la Computación e I.A., E.T.S.I. Informática, Universidad de Granada, Granada, Spain;Departamento de Ciencias de la Computación e I.A., E.T.S.I. Informática, Universidad de Granada, Granada, Spain
Venue:
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Year:
1997

Citing 3
Cited 1

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Characterizations of decomposable dependency models

Journal of Artificial Intelligence Research

Learning probabilistic decision graphs

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Decomposable dependency models and their graphical counterparts, i.e., chordal graphs, possess a number of interesting and useful properties. On the basis of two characterizations of decomposable models in terms of independence relationships, we develop an exact algorithm for recovering the chordal graphical representation of any given decomposable model. We also propose an algorithm for learning chordal approximations of dependency models isomorphic to general undirected graphs.