Finding density-based subspace clusters in graphs with feature vectors (Q1944987)
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 6149251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding density-based subspace clusters in graphs with feature vectors |
scientific article; zbMATH DE number 6149251 |
Statements
Finding density-based subspace clusters in graphs with feature vectors (English)
0 references
28 March 2013
0 references
graph clustering
0 references
dense subgraphs
0 references
networks
0 references
0.7691434025764465
0 references
0.7520988583564758
0 references
0.738734245300293
0 references
0.7381516695022583
0 references
0.7187923192977905
0 references
