Do logarithmic proximity measures outperform plain ones in graph clustering? (Q3133361)
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 6838088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Do logarithmic proximity measures outperform plain ones in graph clustering? |
scientific article; zbMATH DE number 6838088 |
Statements
Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering? (English)
0 references
14 February 2018
0 references
0.7888877391815186
0 references
0.6971756815910339
0 references
0.6931880116462708
0 references
0.6927841305732727
0 references
0.6871169805526733
0 references
