SOURCE-LINKED INTELLIGENCE

Randomized SVD Approximations for Spectral Co-Clustering of Word-Document Matrices

arXiv · Artificial Intelligence · article · Sep 16, 2026 · UTC

Spectral co-clustering is a useful tool for discovering latent structure in word-document matrices, but its reliance on singular value decomposition (SVD) can make standard formulations expensive on high-dimensional data. This paper presents two randomized approximations for normalized spectral co-clustering of bipartite text data when the numbers of document and word clusters may differ. The first method uses randomized SVD through random projection, while the second combines partial SVD with element-wise random sampling. Across real-world and synthetic datasets, both methods reduce runtime r

Read original source ↗ Open in workspace

recordType

paper

region

Global