Graph Partitioning by Correspondence Analysis and Taxicab Correspondence Analysis

Vartan Choulakian () and Jules Tibeiro ()

Journal of Classification, 2013, vol. 30, issue 3, 397-427

Abstract: We consider correspondence analysis (CA) and taxicab correspondence analysis (TCA) of relational datasets that can mathematically be described as weighted loopless graphs. Such data appear in particular in network analysis. We present CA and TCA as relaxation methods for the graph partitioning problem. Examples of real datasets are provided. Copyright Springer Science+Business Media New York 2013

Keywords: Adjacency matrix; Incidence matrix; Network analysis; Graph partitioning; Graph Laplacian matrix; Correspondence analysis; Taxicab correspondence analysis; NCut; RCut; MCut; Matrix norm; Centroid method (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00357-013-9145-4 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jclass:v:30:y:2013:i:3:p:397-427

Ordering information: This journal article can be ordered from
http://www.springer. ... hods/journal/357/PS2

DOI: 10.1007/s00357-013-9145-4

Access Statistics for this article

Journal of Classification is currently edited by Douglas Steinley

More articles in Journal of Classification from Springer, The Classification Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().