Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (Q2268854)
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 5678858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network |
scientific article; zbMATH DE number 5678858 |
Statements
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network (English)
0 references
9 March 2010
0 references
chordal graphs
0 references
minimal triangulations
0 references
Markov networks
0 references
learning decomposable models
0 references
0.8177703619003296
0 references
0.8100070953369141
0 references
0.8066858053207397
0 references
0.8047505021095276
0 references
0.8027657270431519
0 references
