Abstract
There're various kinds of network which can represent bipartite graphs in the real world. Most of clustering methods have been addressed for the unipartite graphs but for a few of the bipartite graph. The unipartite folding has been implemented for the bipartite graph clustering methods. However, these approachs result in lack of link information and consume large computation time. In this paper, we propose a new bipartite clustering mathod based on TSP solution. We propose three cost function definitions with vertex adjacency vectors for TSP. Then, we apply the solution to computer-generated graphs with Local Clustering Organization(LCO). As results of the experiment, we obtained clusters by removing paths with a high cost threshold in the solution, and we found that the cosine-based cost function brings better clusters in applying TSP.
