Acyclic directed graphs representing independence models

被引：4
|
作者：
Baioletti, Marco [2 ]
Busanello, Giuseppe [1 ]
Vantaggi, Barbara [1 ]
机构：
[1] Univ Roma La Sapienza, Dip Sci Base & Applicate Ingn, Rome, Italy
[2] Univ Perugia, Dip Matemat & Informat, I-06100 Perugia, Italy
来源：
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING | 2011年 / 52卷 / 01期
关键词：
Independence models; Graphoid properties; Inferential rules; Acyclic directed graphs; Perfect map; CONDITIONAL-INDEPENDENCE; ALGORITHMS;
D O I：
10.1016/j.ijar.2010.09.005
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper we study the problem of representing probabilistic independence models, in particular those closed under graphoid properties. We focus on acyclic directed graph (DAG): a new algorithm to build a DAG, given an ordering among random variables, is described and peculiarities and advantages of this approach are discussed. Moreover, we provide a necessary and sufficient condition for the existence of a perfect map representing an independence model and we describe an algorithm based on this characterization. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码：2 / 18
页数：17
相关论文
共 50 条
  • [1] Acyclic Directed Graphs to Represent Conditional Independence Models
    Baioletti, Marco
    Busanello, Giuseppe
    Vantaggi, Barbara
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDINGS, 2009, 5590 : 530 - +
  • [2] Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
    Pensar, Johan
    Nyman, Henrik
    Koski, Timo
    Corander, Jukka
    DATA MINING AND KNOWLEDGE DISCOVERY, 2015, 29 (02) : 503 - 533
  • [3] Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
    Johan Pensar
    Henrik Nyman
    Timo Koski
    Jukka Corander
    Data Mining and Knowledge Discovery, 2015, 29 : 503 - 533
  • [4] ON THE RELATION BETWEEN CONDITIONAL-INDEPENDENCE MODELS DETERMINED BY FINITE DISTRIBUTIVE LATTICES AND BY DIRECTED ACYCLIC GRAPHS
    ANDERSSON, SA
    MADIGAN, D
    PERLMAN, MD
    TRIGGS, CM
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1995, 48 (01) : 25 - 46
  • [5] Max-linear models on directed acyclic graphs
    Gissibl, Nadine
    Klueppelberg, Claudia
    BERNOULLI, 2018, 24 (4A) : 2693 - 2720
  • [6] COMMENT: ACYCLIC DIRECTED MIXED GRAPHS FOR MARGINALIZED MODELS
    Evans, Robin J.
    SOCIOLOGICAL METHODOLOGY 2013, VOL 43, 2013, 43 : 104 - 106
  • [7] Conditional independence collapsibility for acyclic directed mixed graph models
    Li, Weihua
    Sun, Yi
    Heng, Pei
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2024, 170
  • [8] Identification In Missing Data Models Represented By Directed Acyclic Graphs
    Bhattacharya, Rohit
    Nabi, Razieh
    Shpitser, Ilya
    Robins, James M.
    35TH UNCERTAINTY IN ARTIFICIAL INTELLIGENCE CONFERENCE (UAI 2019), 2020, 115 : 1149 - 1158
  • [9] Acyclic Partitioning of Large Directed Acyclic Graphs
    Herrmann, Julien
    Kho, Jonathan
    Ucar, Bora
    Kaya, Kamer
    Catalyurek, Umit V.
    2017 17TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), 2017, : 371 - 380
  • [10] Counting acyclic orderings in directed acyclic graphs
    Fox, Joseph
    Judd, Aimee
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2020, 115 : 271 - 286
12345