Multicuts and perturb \& MAP for probabilistic graph clustering (Q334274)
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: Multicuts and perturb \& MAP for probabilistic graph clustering |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multicuts and perturb \& MAP for probabilistic graph clustering |
scientific article |
Statements
Multicuts and perturb \& MAP for probabilistic graph clustering (English)
0 references
1 November 2016
0 references
correlation clustering
0 references
multicut
0 references
graphical models
0 references
perturb and MAP
0 references
0 references
0 references
0 references
0.9027803540229796
0 references
0.7235425710678101
0 references
0.720399022102356
0 references
0.7146360874176025
0 references
0.7108900547027588
0 references
