Algorithms for Learning Decomposable Models and Chordal Graphs


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

Extracted Key Phrases

Cite this paper

@inproceedings{Campos1997AlgorithmsFL, title={Algorithms for Learning Decomposable Models and Chordal Graphs}, author={Luis M. de Campos and Juan F. Huete}, booktitle={UAI}, year={1997} }