Mixed Cumulative Distribution Networks

08/31/2010
by   Ricardo Silva, et al.
0

Directed acyclic graphs (DAGs) are a popular framework to express multivariate probability distributions. Acyclic directed mixed graphs (ADMGs) are generalizations of DAGs that can succinctly capture much richer sets of conditional independencies, and are especially useful in modeling the effects of latent variables implicitly. Unfortunately there are currently no good parameterizations of general ADMGs. In this paper, we apply recent work on cumulative distribution networks and copulas to propose one one general construction for ADMG models. We consider a simple parameter estimation approach, and report some encouraging experimental results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2014

A factorization criterion for acyclic directed mixed graphs

Acyclic directed mixed graphs, also known as semi-Markov models represen...
research
03/15/2012

Maximum likelihood fitting of acyclic directed mixed graphs to binary data

Acyclic directed mixed graphs, also known as semi-Markov models represen...
research
07/20/2012

Parameter and Structure Learning in Nested Markov Models

The constraints arising from DAG models with latent variables can be nat...
research
11/28/2019

Constraints in Gaussian Graphical Models

In this paper, we consider the problem of finding the constraints in bow...
research
10/27/2021

Approximation Methods for Mixed Models with Probit Link Functions

We study approximation methods for a large class of mixed models with a ...
research
09/11/2023

Combinative Cumulative Knowledge Processes

We analyze Cumulative Knowledge Processes, introduced by Ben-Eliezer, Mi...
research
10/27/2022

Learning Discrete Directed Acyclic Graphs via Backpropagation

Recently continuous relaxations have been proposed in order to learn Dir...

Please sign up or login with your details

Forgot password? Click here to reset