Bipartite graph partitioning and data clustering
<|reference_start|>Bipartite graph partitioning and data clustering: Many data types arising from data mining applications can be modeled as bipartite graphs, examples include terms and documents in a text corpus, customers and purchasing items in market basket analysis and reviewers and movies in a movie recommender system. In this paper, we propose a new data clustering method based on partitioning the underlying bipartite graph. The partition is constructed by minimizing a normalized sum of edge weights between unmatched pairs of vertices of the bipartite graph. We show that an approximate solution to the minimization problem can be obtained by computing a partial singular value decomposition (SVD) of the associated edge weight matrix of the bipartite graph. We point out the connection of our clustering algorithm to correspondence analysis used in multivariate analysis. We also briefly discuss the issue of assigning data objects to multiple clusters. In the experimental results, we apply our clustering algorithm to the problem of document clustering to illustrate its effectiveness and efficiency.<|reference_end|>
@article{zha2001bipartite,
    title={Bipartite graph partitioning and data clustering},
    author={H. Zha, X. He, C. Ding, M. Gu and H. Simon},
    journal={arXiv preprint arXiv:cs/0108018},
    year={2001},
    archivePrefix={arXiv},
    eprint={cs/0108018},
    primaryClass={cs.IR cs.LG}
}