Skip to Main content Skip to Navigation
Conference papers

Sparse Correspondence Analysis for Contingency Tables

Gilbert Saporta 1
1 CEDRIC - MSDMA - CEDRIC. Méthodes statistiques de data-mining et apprentissage
CEDRIC - Centre d'études et de recherche en informatique et communications
Abstract : Since the introduction of the lasso in regression, various sparse methods have been developed in an unsupervised context like sparse principal component analysis (s-PCA) and sparse singular value decomposition (s-SVD). One advantage of s-PCAis to simplify the interpretation of the (pseudo) principal components since each one isexpressed as a linear combination of a small number of variables. The disadvantages lie on the one hand in the difficulty of choosing the number of non-zero coefficients in the absence of a well established criterion and on the other hand in the loss of orthogonality for the components and/or the loadings. We propose s-CA, a sparse variant of correspondence analysis (CA) for large contingency tables like documents-terms matrices used in textmining, together with pPMD, a projected deflation technique already used in s-PCA. Since CA is a double weighted PCA (for rows and columns) or a weighted SVD, we apply s-SVD in order to sparsify both rows and columns weights. The user may tune the level of sparsity of rows and columns and optimize it according to some criterium, and even decide that no sparsity is needed for rows (or columns) by relaxing one sparsity constraint.
Document type :
Conference papers
Complete list of metadata
Contributor : Gilbert Saporta <>
Submitted on : Sunday, March 28, 2021 - 6:07:28 PM
Last modification on : Tuesday, March 30, 2021 - 3:28:12 AM


  • HAL Id : hal-03183719, version 1



Gilbert Saporta. Sparse Correspondence Analysis for Contingency Tables. Celebrating 40 years of Greek Statistical Institute 1981-2021, Greek Statistical Institute, Mar 2021, Athènes, Greece. ⟨hal-03183719⟩



Record views