Graphical presentation of confounding in directed acyclic graphs

被引:141
|
作者
Suttorp, Marit M. [1 ]
Siegerink, Bob [1 ]
Jager, Kitty J. [2 ]
Zoccali, Carmine [3 ]
Dekker, Friedo W. [1 ]
机构
[1] Leiden Univ, Med Ctr, Dept Clin Epidemiol, Leiden, Netherlands
[2] Univ Amsterdam, Acad Med Ctr, Dept Med Informat, ERA EDTA Registry, NL-1105 AZ Amsterdam, Netherlands
[3] CNR, IBIM, Clin Epidemiol & Pathophysiol Renal Dis & Hyperte, Reggio Di Calabria, Italy
关键词
confounding; causal; DAGs; directed acyclic graph; epidemiology; ASSOCIATION; BIAS; ESRD;
D O I
10.1093/ndt/gfu325
中图分类号
R3 [基础医学]; R4 [临床医学];
学科分类号
1001 ; 1002 ; 100602 ;
摘要
Since confounding obscures the real effect of the exposure, it is important to adequately address confounding for making valid causal inferences from observational data. Directed acyclic graphs (DAGs) are visual representations of causal assumptions that are increasingly used in modern epidemiology. They can help to identify the presence of confounding for the causal question at hand. This structured approach serves as a visual aid in the scientific discussion by making underlying relations explicit. This article explains the basic concepts of DAGs and provides examples in the field of nephrology with and without presence of confounding. Ultimately, these examples will show that DAGs can be preferable to the traditional methods to identify sources of confounding, especially in complex research questions.
引用
收藏
页码:1418 / 1423
页数:6
相关论文
共 50 条
  • [21] MULTILEVEL ALGORITHMS FOR ACYCLIC PARTITIONING OF DIRECTED ACYCLIC GRAPHS
    Herrmann, Julien
    Ozkaya, M. Yusuf
    Ucar, Bora
    Kaya, Kamer
    Catalyurek, Umit, V
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2019, 41 (04): : A2117 - A2145
  • [22] Recursive processing of directed acyclic graphs
    Bianchini, M
    Gori, M
    Scarselli, F
    [J]. NEURAL NETS WIRN VIETRI-01, 2002, : 96 - 101
  • [23] Ternary directed acyclic word graphs
    Miyamoto, S
    Inenaga, S
    Takeda, M
    Shinohara, A
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2003, 2759 : 120 - 130
  • [24] HEURISTIC CHAINING IN DIRECTED ACYCLIC GRAPHS
    VENUGOPAL, R
    SRIKANT, YN
    [J]. COMPUTER LANGUAGES, 1993, 19 (03): : 169 - 184
  • [25] LCA queries in directed acyclic graphs
    Kowaluk, M
    Lingas, A
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 241 - 248
  • [26] Community detection in directed acyclic graphs
    Speidel, Leo
    Takaguchi, Taro
    Masuda, Naoki
    [J]. EUROPEAN PHYSICAL JOURNAL B, 2015, 88 (08):
  • [27] On counting homomorphisms to directed acyclic graphs
    Dyer, Martin
    Goldberg, Leslie Ann
    Paterson, Mike
    [J]. JOURNAL OF THE ACM, 2007, 54 (06)
  • [28] Algebras associated to acyclic directed graphs
    Retakh, Vladimir
    Wilson, Robert Lee
    [J]. ADVANCES IN APPLIED MATHEMATICS, 2009, 42 (01) : 42 - 59
  • [29] Covering Pairs in Directed Acyclic Graphs
    Beerenwinkel, Niko
    Beretta, Stefano
    Bonizzoni, Paola
    Dondi, Riccardo
    Pirola, Yuri
    [J]. COMPUTER JOURNAL, 2015, 58 (07): : 1673 - 1686
  • [30] On counting homomorphisms to directed acyclic graphs
    Dyer, Martin
    Goldberg, Leslie Ann
    Paterson, Mike
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 38 - 49