Characterizations of Decomposable Dependency Models | Zendy

Luis M. de Campos | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Characterizations of Decomposable Dependency Models

Author(s) -

Luis M. de Campos

Publication year - 1996

Publication title -

journal of artificial intelligence research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.79

H-Index - 123

eISSN - 1943-5037

pISSN - 1076-9757

DOI - 10.1613/jair.329

Subject(s) - dependency (uml) , axiom , independence (probability theory) , set (abstract data type) , graphical model , computer science , theoretical computer science , functional dependency , conditional independence , dependency graph , mathematics , algorithm , artificial intelligence , graph , data mining , relational database , statistics , geometry , programming language

Decomposable dependency models possess a number of interesting and useful properties. This paper presents new characterizations of decomposable models in terms of independence relationships, which are obtained by adding a single axiom to the well-known set characterizing dependency models that are isomorphic to undirected graphs. We also briefly discuss a potential application of our results to the problem of learning graphical models from data.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research