Exact estimation of multiple directed acyclic graphs

Publication Type:
Journal Article
Statistics and Computing, 2016, 26 (4), pp. 797 - 811
Issue Date:
Filename Description Size
art%3A10.1007%2Fs11222-015-9570-9.pdfAccepted Manuscript Version931.8 kB
Adobe PDF
Full metadata record
© 2015, Springer Science+Business Media New York. 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.
Please use this identifier to cite or link to this item: