DeepAI AI Chat
Log In Sign Up

Exact Estimation of Multiple Directed Acyclic Graphs

by   Chris J. Oates, et al.
University of York
University of Cambridge
University of Warwick

This paper considers the problem of estimating the structure of multiple related directed acyclic graph (DAG) models. Building on recent developments in exact estimation of DAGs using integer linear programming (ILP), we present an ILP approach for joint estimation over multiple DAGs, that does not require that the vertices in each DAG share a common ordering. Furthermore, we allow also for (potentially unknown) dependency structure between the DAGs. Results are presented on both simulated data and fMRI data obtained from multiple subjects.


page 20

page 21


Bayesian joint inference for multiple directed acyclic graphs

In many applications, data often arise from multiple groups that may sha...

Priors on exchangeable directed graphs

Directed graphs occur throughout statistical modeling of networks, and e...

Solving Bayesian Network Structure Learning Problem with Integer Linear Programming

This dissertation investigates integer linear programming (ILP) formulat...

Directed Acyclic Outerplanar Graphs Have Constant Stack Number

The stack number of a directed acyclic graph G is the minimum k for whic...

Fuzzy Alignments in Directed Acyclic Graph for Non-Autoregressive Machine Translation

Non-autoregressive translation (NAT) reduces the decoding latency but su...

A Continuous Max-Flow Approach to Multi-Labeling Problems under Arbitrary Region Regularization

The incorporation of region regularization into max-flow segmentation ha...