Exact estimation of multiple directed acyclic graphs

From MaRDI portal
Publication:2628883




Abstract: 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.



Cites work



Describes a project that uses

Uses Software





This page was built for publication: Exact estimation of multiple directed acyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628883)