Co-clustering documents and words using bipartite spectral graph partitioning

Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we present the novel idea of modeling the document collection as a bipartite graph between documents and words, using which the simultaneous clustering problem can be posed as a bipartite graph partitioning problem. To solve the partitioning problem, we use a new spectral co-clustering algorithm that uses the second left and right singular vectors of an appropriately scaled word-document matrix to yield good bipartitionings. The spectral algorithm enjoys some optimality properties; it can be shown that the singular vectors solve a real relaxation to the NP-complete graph bipartitioning problem. We present experimental results to verify that the resulting co-clustering algorithm works well in practice.

• Type: Conference
• Year: 2001
• Where: KDD
• Authors: Inderjit S. Dhillon
• Keywords: Data Mining, Graph Bipartitioning Problem, Graph Partitioning Problem, KDD 2001, Simultaneous Clustering Problem