Finding community structure in networks using a shortest-path-based \(k\)-means algorithm (Q2860017)
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 6230407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding community structure in networks using a shortest-path-based \(k\)-means algorithm |
scientific article; zbMATH DE number 6230407 |
Statements
19 November 2013
0 references
community structure
0 references
modularity
0 references
shortest path
0 references
\(k\)-means algorithm
0 references
Finding community structure in networks using a shortest-path-based \(k\)-means algorithm (English)
0 references
0.8519402146339417
0 references
0.8307974934577942
0 references
0.8253307938575745
0 references
0.8076462149620056
0 references
0.8076462149620056
0 references
