Characterizations of Decomposable Dependency Models

12/01/1996
by   L. M. deCampos, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2013

Algorithms for Learning Decomposable Models and Chordal Graphs

Decomposable dependency models and their graphical counterparts, i.e., c...
research
10/02/2022

Neural Graphical Models

Graphs are ubiquitous and are often used to understand the dynamics of a...
research
09/07/2009

High-dimensional Graphical Model Search with gRapHD R Package

This paper presents the R package gRapHD for efficient selection of high...
research
02/13/2013

An Algorithm for Finding Minimum d-Separating Sets in Belief Networks

The criterion commonly used in directed acyclic graphs (dags) for testin...
research
07/21/2019

Log-linear models independence structure comparison

Log-linear models are a family of probability distributions which captur...
research
03/18/2022

Improving Heuristic-based Process Discovery Methods by Detecting Optimal Dependency Graphs

Heuristic-based methods are among the most popular methods in the proces...
research
10/19/2012

On Triangulating Dynamic Graphical Models

This paper introduces new methodology to triangulate dynamic Bayesian ne...

Please sign up or login with your details

Forgot password? Click here to reset