Exact estimation of multiple directed acyclic graphsDownload PDFOpen Website

2016 (modified: 16 Apr 2023)Stat. Comput. 2016Readers: Everyone
Abstract: This paper considers structure learning for 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. Unlike previous work, we do not require that the vertices in each DAG share a common ordering. Furthermore, we allow for (potentially unknown) dependency structure between the DAGs. Results are presented on both simulated data and fMRI data obtained from multiple subjects.
0 Replies

Loading