.png){kind=icon}
返回
Acyclic directed graphs representing independence models
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2010.09.005.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Independence models
Graphoid properties
Inferential rules
Acyclic directed graphs
Perfect map
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
.png){kind=icon}
Characterisation of Fibre/Matrix Adhesion in Biobased Fibre‐Reinforced Thermoplastic Composites
PREAI
分享收藏Effect of chromium content on microstructure and properties of casting Al‐7Si‐0.35Mg‐0.02Sr alloy
PREAI
分享收藏
查看更多内容