SVD, discrepancy, and regular structure of contingency tables

DOI10.1016/J.DAM.2014.03.022zbMATH Open1300.05158arXiv1301.5259OpenAlexW2160001112MaRDI QIDQ403553FDOQ403553

Marianna Bolla

Publication date: 29 August 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: We will use the factors obtained by correspondence analysis to find biclustering of a contingency table such that the row-column cluster pairs are regular, i.e., they have small discrepancy. In our main theorem, the constant of the so-called volume-regularity is related to the SVD of the normalized contingency table. Our result is applicable to two-way cuts when both the rows and columns are divided into the same number of clusters, thus extending partly the result of Butler estimating the discrepancy of a contingency table by the second largest singular value of the normalized table (one-cluster, rectangular case), and partly a former result of the author for estimating the constant of volume-regularity by the structural eigenvalues and the distances of the corresponding eigen-subspaces of the normalized modularity matrix of an edge-weighted graph (several clusters, symmetric case).

Full work available at URL: https://arxiv.org/abs/1301.5259

Recommendations

• Latent Structure Analysis of a Set of Multidimensional Contingency Tables
• Sparse correspondence analysis for large contingency tables
• Alternative statistical models and representations for large sparse multi-dimensional contingency tables
• Contingency tables and the generalized Littlewood-Richardson coefficients
• scientific article; zbMATH DE number 3915606
• scientific article; zbMATH DE number 3942796
• scientific article; zbMATH DE number 3862251
• Semiparametric smoothing of sparse contingency tables

zbMATH Keywords

biclusteringdiscrepancydirected graphsnormalized contingency tablenormalized two-way cuts

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Cites Work

• Limits of dense graph sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast monte-carlo algorithms for finding low-rank approximations
• Hermitian matrices and graphs: Singular values and discrepancy
• Modularity spectra, eigen-subspaces, and structure of weighted graphs
• Using discrepancy to control singular values for nonnegative matrices
• Lifts, discrepancy and nearly optimal spectral gap
• Clustering large graphs via the singular value decomposition
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Quick approximation to matrices and applications
• Biclustering via Sparse Singular Value Decomposition
• Robust singular value decomposition analysis of microarray data
• Singular value decomposition of large random matrices (for two-way classification of microarrays)
• Separation theorems for singular values of matrices and their applications in multivariate analysis
• Spectra and optimal partitions of weighted graphs
• Biclustering in data mining
• Analysis of the singular value decomposition as a tool for processing microarray expression data
• Title not available (Why is that?)

Cited In (2)

• Relating multiway discrepancy and singular values of nonnegative rectangular matrices
• Matrix and discrepancy view of generalized random and quasirandom graphs

This page was built for publication: SVD, discrepancy, and regular structure of contingency tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403553)