Clustering large attributed information networks: an efficient incremental computing approach (Q1945001)
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: Clustering large attributed information networks: an efficient incremental computing approach |
scientific article; zbMATH DE number 6149258
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Clustering large attributed information networks: an efficient incremental computing approach |
scientific article; zbMATH DE number 6149258 |
Statements
Clustering large attributed information networks: an efficient incremental computing approach (English)
0 references
28 March 2013
0 references
graph clustering
0 references
vertex partitioning
0 references
vertex properties
0 references
incremental computation
0 references
parallel computing
0 references
SA-cluster
0 references
structural and attribute similarities
0 references
random walk distances
0 references
clustering refinement
0 references
edge weights
0 references
0 references
0.8803834
0 references
0.8546629
0 references
0.85009027
0 references
0.8486861
0 references
0.84770596
0 references
0.84706926
0 references
