Clustering Bipartite Graphs by Using Singular Value Decomposition

Clustering Bipartite Graphs by Using Singular Value Decomposition

Graphs have so many applications in real world problems. Bipartite graphs is a special case of graphs whose vertices can be divided into two disjoint and independent sets and so many Problems can be model as bipartite graph such as Documents-Keywords problem. For clustering a bipartite graph do not need to cluster all vertices, in the other word each independent set of vertices can be clustered distinctly but adjacency matrix of these independent set are not necessarily square. Singular value decomposition is a powerful tool in mathematics for clustering data and it can be used for all types of matrices. In this paper we used Singular value decomposition to cluster bipartite graph.

Graphs have so many applications in real world problems. Bipartite graphs is a special case of graphs whose vertices can be divided into two disjoint and independent sets and so many Problems can be model as bipartite graph such as Documents-Keywords problem. For clustering a bipartite graph do not need to cluster all vertices, in the other word each independent set of vertices can be clustered distinctly but adjacency matrix of these independent set are not necessarily square. Singular value decomposition is a powerful tool in mathematics for clustering data and it can be used for all types of matrices. In this paper we used Singular value decomposition to cluster bipartite graph.