Conditional independence collapsibility for acyclic directed mixed graph models

被引:0
|
作者
Li, Weihua [1 ]
Sun, Yi [1 ,2 ]
Heng, Pei [2 ]
机构
[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830000, Xinjiang, Peoples R China
[2] Northeast Normal Univ, KLAS, Changchun 130024, Jilin, Peoples R China
关键词
Acyclic directed mixed graph; Conditional independence collapsibility; Directed acyclic graph; Graphical model; DAG MODELS; MARKOV PROPERTIES;
D O I
10.1016/j.ijar.2024.109208
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Collapsibility refers to the property that, when marginalizing over some variables that are not of interest from the full model, the resulting marginal model of the remaining variables is equivalent to the local model induced by the subgraph on these variables. This means that when the marginal model satisfies collapsibility, statistical inference results based on the marginal model and the local model are consistent. This has significant implications for small -sample data, modeling latent variable data, and reducing the computational complexity of statistical inference. This paper focuses on studying the conditional independence collapsibility of acyclic directed mixed graph (ADMG) models. By introducing the concept of inducing paths in ADMGs and exploring its properties, the conditional independence collapsibility of ADMGs is characterized equivalently from both graph theory and statistical perspectives.
引用
收藏
页数:11
相关论文
共 50 条
  • [31] CORRESPONDENCE-ANALYSIS AND ASSOCIATION MODELS CONSTRAINED BY A CONDITIONAL-INDEPENDENCE GRAPH
    DEFALGUEROLLES, A
    JMEL, S
    WHITTAKER, J
    PSYCHOMETRIKA, 1995, 60 (02) : 161 - 180
  • [32] Relaxing the local independence assumption for quantitative learning in acyclic directed graphical models through hierarchical partition models
    Golinelli, D
    Madigan, D
    Consonni, G
    ARTIFICIAL INTELLIGENCE AND STATISTICS 99, PROCEEDINGS, 1999, : 203 - 208
  • [33] On the core and nucleolus of directed acyclic graph games
    Balázs Sziklai
    Tamás Fleiner
    Tamás Solymosi
    Mathematical Programming, 2017, 163 : 243 - 271
  • [34] Design of directed acyclic graph multiclass structures
    Lorena, Ana C.
    Carvalho, Andre C. P. L. F.
    NEURAL NETWORK WORLD, 2007, 17 (06) : 657 - 673
  • [35] MINIMIZATION OF PLANAR DIRECTED ACYCLIC GRAPH ALGEBRAS
    Kalampakas, Antonios
    Louscou-Bozapalidou, Olympla
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (04) : 519 - 531
  • [36] A Delegation Model Based on Directed Acyclic Graph
    Zhang, Xiujuan
    Zhang, Dianming
    Zhang, Yuanke
    Wu, Junhua
    COMMUNICATIONS AND INFORMATION PROCESSING, PT 2, 2012, 289 : 265 - +
  • [37] ON THE SIGNIFICANCE OF THE DIRECTED ACYCLIC WORD GRAPH IN CRYPTOLOGY
    JANSEN, CJA
    BOEKEE, DE
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 453 : 318 - 326
  • [38] Directed Acyclic Graph Kernels for Action Recognition
    Wang, Ling
    Sahbi, Hichem
    2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2013, : 3168 - 3175
  • [39] Facets of the directed acyclic graph layering polytope
    Healy, P
    Nikolov, NS
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2002, 2573 : 246 - 257
  • [40] The number of descendants in a random directed acyclic graph
    Janson, Svante
    RANDOM STRUCTURES & ALGORITHMS, 2024, 64 (03) : 768 - 803