Minimal separators in dependency structures: properties and identification (Q1008353)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5534501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal separators in dependency structures: properties and identification |
scientific article; zbMATH DE number 5534501 |
Statements
Minimal separators in dependency structures: properties and identification (English)
0 references
27 March 2009
0 references
acyclic digraph
0 references
probabilistic dependency model
0 references
DAG model
0 references
conditional independence
0 references
identification of edges
0 references
Bayesian network
0 references
\(d\)-separation criterion
0 references
collider
0 references
chain
0 references
locally minimal separators
0 references
selection of separators
0 references
necessary requirements on members of locally minimal separators
0 references
constraint-based learning algorithm
0 references
0.8626275658607483
0 references
0.8359842896461487
0 references
0.7578018307685852
0 references
0.7531578540802002
0 references
