An efficient algorithm for computing the distance between close partitions (Q617900)
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 5836569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for computing the distance between close partitions |
scientific article; zbMATH DE number 5836569 |
Statements
An efficient algorithm for computing the distance between close partitions (English)
0 references
14 January 2011
0 references
partition distance
0 references
partition metric
0 references
similarity between partitions
0 references
clustering comparison
0 references
similarity measure
0 references
0 references
0.8046740889549255
0 references
0.7889776825904846
0 references
0.7851906418800354
0 references
0.7818293571472168
0 references
0.780552327632904
0 references
