Bipartite graph partitioning and data clustering

Details Bipartite graph partitioning and data clustering Bipartite graph partitioning and data clustering

2001-08-27

arxiv.org/abs/cs/0108018v1

Computer Science

Information Retrieval

Proceedings of ACM CIKM 2001, the Tenth International Conference on Information and Knowledge Management, 2001

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bipartite graph partitioning and data clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bipartite graph partitioning and data clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bipartite graph partitioning and data clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-113210