Concise representations and construction algorithms for semi-graphoid independency models (Q2374537)
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: Concise representations and construction algorithms for semi-graphoid independency models |
scientific article; zbMATH DE number 6664080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concise representations and construction algorithms for semi-graphoid independency models |
scientific article; zbMATH DE number 6664080 |
Statements
Concise representations and construction algorithms for semi-graphoid independency models (English)
0 references
15 December 2016
0 references
conditional independence
0 references
semi-graphoid axioms
0 references
closure
0 references
closure representation
0 references
dominant independence statements
0 references
0.9672256112098694
0 references
0.8091343641281128
0 references
0.7982001900672913
0 references
0.7889901995658875
0 references
