Exact estimation of multiple directed acyclic graphs

被引：23

作者：

Oates, Chris J. ^{[1
,6
]}

Smith, Jim Q. ^{[1
]}

Mukherjee, Sach ^{[2
,3
,7
]}

Cussens, James ^{[4
,5
]}

机构：

[1] Univ Warwick, Dept Stat, Coventry CV4 7AL, W Midlands, England

[2] Univ Cambridge, MRC Biostat Unit, Cambridge CB2 0SR, England

[3] Univ Cambridge, CRUK Cambridge Inst, Cambridge CB2 0SR, England

[4] Univ York, Dept Comp Sci, York YO10 5GE, N Yorkshire, England

[5] Univ York, York Ctr Complex Syst Anal, York YO10 5GE, N Yorkshire, England

[6] Univ Technol Sydney, Sch Math & Phys Sci, POB 123, Sydney, NSM 2007, Australia

[7] German Ctr Neurodegenerat Dis DZNE, D-53175 Bonn, Germany

来源：

STATISTICS AND COMPUTING | 2016年 / 26卷 / 04期

基金：

英国医学研究理事会; 英国工程与自然科学研究理事会;

关键词：

Hierarchical model; Bayesian network; Multiregression dynamical model; Integer linear programming; Joint estimation; INVERSE COVARIANCE ESTIMATION; BAYESIAN NETWORKS; EFFECTIVE CONNECTIVITY; RECONSTRUCTION; KNOWLEDGE; INFERENCE;

D O I：

10.1007/s11222-015-9570-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：797 / 811

页数：15

共 50 条

[31] Community detection in directed acyclic graphs
Speidel, Leo
Takaguchi, Taro
Masuda, Naoki
EUROPEAN PHYSICAL JOURNAL B, 2015, 88 (08):
[32] On counting homomorphisms to directed acyclic graphs
Dyer, Martin
Goldberg, Leslie Ann
Paterson, Mike
JOURNAL OF THE ACM, 2007, 54 (06)
[33] Recursive processing of directed acyclic graphs
Bianchini, M
Gori, M
Scarselli, F
NEURAL NETS WIRN VIETRI-01, 2002, : 96 - 101
[34] Ternary directed acyclic word graphs
Miyamoto, S
Inenaga, S
Takeda, M
Shinohara, A
IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2003, 2759 : 120 - 130
[35] HEURISTIC CHAINING IN DIRECTED ACYCLIC GRAPHS
VENUGOPAL, R
SRIKANT, YN
COMPUTER LANGUAGES, 1993, 19 (03): : 169 - 184
[36] On compact directed acyclic word graphs
Crochemore, M
Verin, R
STRUCTURES IN LOGIC AND COMPUTER SCIENCE: A SELECTION OF ESSAYS IN HONOR OF A. EHRENFEUCHT, 1997, 1261 : 192 - 211
[37] Broadcasting on Random Directed Acyclic Graphs
Makur, Anuran
Mossel, Elchanan
Polyanskiy, Yury
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (02) : 780 - 812
[38] Information Flow on Directed Acyclic Graphs
Donders, Michael
More, Sara Miner
Naumov, Pavel
LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, WOLLIC 2011, 2011, 6642 : 95 - 109
[39] Community detection in directed acyclic graphs
Leo Speidel
Taro Takaguchi
Naoki Masuda
The European Physical Journal B, 2015, 88
[40] Covering Pairs in Directed Acyclic Graphs
Beerenwinkel, Niko
Beretta, Stefano
Bonizzoni, Paola
Dondi, Riccardo
Pirola, Yuri
COMPUTER JOURNAL, 2015, 58 (07): : 1673 - 1686

← 1 2 3 4 5 →