Graph partitioning by correspondence analysis and taxicab correspondence analysis (Q269116): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00357-013-9145-4 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2170817959 / rank | |||
Revision as of 14:59, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph partitioning by correspondence analysis and taxicab correspondence analysis |
scientific article |
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
