Graph partitioning by correspondence analysis and taxicab correspondence analysis (Q269116)

From MaRDI portal
Revision as of 18:19, 19 March 2024 by Openalex240319050325 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    18 April 2016
    0 references
    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 references