.png){kind=icon}
Return
A reconstruction algorithm for the essential graph
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2008.09.001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A standard graphical representative of a Bayesian network structure is a special chain graph, known as an essential graph. An alternative algebraic approach to the mathematical description of this statistical model uses instead a certain integer-valued vector, known as a standard imset. We give a direct formula for the translation of any chain graph describing a Bayesian network structure into the standard imset. Moreover, we present a two-stage algorithm which makes it possible to reconstruct the essential graph on the basis of the standard imset. The core of this paper is the proof of the correctness of the algorithm. (C) 2008 Elsevier Inc. All rights reserved.
Keywords:
Bayesian network structure
Chain graph
Essential graph
Standard imset
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
3.0K
Citations:
5.1K
Organization
Cited Papers
Ultrasound‐Guided First Dorsal Compartment Release for Refractory de Quervain Tenosynovitis: A Case Report.png)
PM&R
PM&RIF0
PREAI
ShareSaveShareSave no more
no more