On scoring maximal ancestral graphs with the max-min hill climbing algorithm (Q1726268)
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 7025874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On scoring maximal ancestral graphs with the max-min hill climbing algorithm |
scientific article; zbMATH DE number 7025874 |
Statements
On scoring maximal ancestral graphs with the max-min hill climbing algorithm (English)
0 references
20 February 2019
0 references
hybrid causal structure learning
0 references
maximal ancestral graphs
0 references
max-min hill climbing
0 references
0 references
0 references
0.7737560868263245
0 references
0.7495974898338318
0 references
0.7459571957588196
0 references
0.7412300705909729
0 references
