Graph partitioning by correspondence analysis and taxicab correspondence analysis (Q269116)
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 6569974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph partitioning by correspondence analysis and taxicab correspondence analysis |
scientific article; zbMATH DE number 6569974 |
Statements
Graph partitioning by correspondence analysis and taxicab correspondence analysis (English)
0 references
18 April 2016
0 references
adjacency matrix
0 references
incidence matrix
0 references
network analysis
0 references
graph partitioning
0 references
graph Laplacian matrix
0 references
correspondence analysis
0 references
taxicab correspondence analysis
0 references
NCut
0 references
RCut
0 references
MCut
0 references
matrix norm
0 references
centroid method
0 references
0.7740262150764465
0 references
0.7704435586929321
0 references
0.736183226108551
0 references
0.7267153859138489
0 references
0.7200276851654053
0 references
