Graph Partitioning by Correspondence Analysis and Taxicab Correspondence Analysis |
| |
| Authors: | Vartan Choulakian Jules de Tibeiro |
| |
| Affiliation: | 1. Dépt. de Math./Statistique, Université de Moncton, Moncton, NB, Canada, E1A 3E9
2. Secteur Sciences, Université de Moncton, Shippagan, NB, Canada
|
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
