An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity (Q2880919)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity |
scientific article; zbMATH DE number 6025068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity |
scientific article; zbMATH DE number 6025068 |
Statements
17 April 2012
0 references
graphical models
0 references
graphical criterion
0 references
reading dependencies
0 references
undirected independence map
0 references
independencies
0 references
vertex separation
0 references
graphoids
0 references
weak transitivity
0 references
algorithm
0 references
bioinformatics
0 references
0.84507245
0 references
0.83064663
0 references
0.8285405
0 references
0.8255137
0 references
0.8247294
0 references
0.82314646
0 references
0.8230987
0 references
An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity (English)
0 references
