Graph partitioning by correspondence analysis and taxicab correspondence analysis

DOI10.1007/s00357-013-9145-4zbMath1360.62303OpenAlexW2170817959MaRDI QIDQ269116

Vartan Choulakian, Jules J. S. de Tibeiro

Publication date: 18 April 2016

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-013-9145-4

zbMATH Keywords

incidence matrixadjacency matrixgraph partitioningmatrix normcorrespondence analysisnetwork analysistaxicab correspondence analysiscentroid methodgraph Laplacian matrixMCutNCutRCut

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (1)

Some new aspects of taxicab correspondence analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics of \(L_{p}\)-type and distributional equivalence principle
• Multiple taxicab correspondence analysis
• L1-norm projection pursuit principal component analysis
• Statistical analysis of network data. Methods and models
• Transposition invariant principal component analysis in \(L_{1}\) for long tailed data
• Exact analysis of a paired sibling data
• Principal component analysis.
• The optimality of the centroid method
• Taxicab correspondence analysis
• Taxicab correspondence analysis of contingency tables with one heavy weight column
• Correspondence analysis with incomplete paired data using Bayesian imputation
• Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights
• Approximating the Cut-Norm via Grothendieck's Inequality

This page was built for publication: Graph partitioning by correspondence analysis and taxicab correspondence analysis