Towards using the chordal graph polytope in learning decomposable models (Q2411269)
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 6794512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards using the chordal graph polytope in learning decomposable models |
scientific article; zbMATH DE number 6794512 |
Statements
Towards using the chordal graph polytope in learning decomposable models (English)
0 references
20 October 2017
0 references
learning decomposable models
0 references
integer linear programming
0 references
characteristic imset
0 references
chordal graph polytope
0 references
clutter inequalities
0 references
separation problem
0 references
0 references
0 references
0.86811966
0 references
0.86297226
0 references
0.85345006
0 references
0.8432596
0 references
0.8401666
0 references
0.8392908
0 references
0.83660775
0 references
0.83524543
0 references
0.8280128
0 references
