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.
Graph partitioning by Correspondence Analysis and Taxicab Correspondence Analysis / Balbi, Simona. - (2014).
Graph partitioning by Correspondence Analysis and Taxicab Correspondence Analysis
BALBI, SIMONA
2014
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
