Efficient clustering of large uncertain graphs using neighborhood information (Q1678437)
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: Efficient clustering of large uncertain graphs using neighborhood information |
scientific article; zbMATH DE number 6808372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient clustering of large uncertain graphs using neighborhood information |
scientific article; zbMATH DE number 6808372 |
Statements
Efficient clustering of large uncertain graphs using neighborhood information (English)
0 references
17 November 2017
0 references
clustering
0 references
uncertain graphs
0 references
graph-based clustering
0 references
heuristic clustering algorithm
0 references
0.7303390502929688
0 references
0.7276616096496582
0 references
0.7047880291938782
0 references
0.7024290561676025
0 references
0.7001824975013733
0 references
