2A1-J08 Clustering Analysis of Bipartite Graphs by TSP Solution
Keiu Harada, Shinichiro Yoshii, Masashi Furukawa · The Proceedings of JSME annual Conference on Robotics and Mechatronics (Robomec) · 2007
There're a various networks which can represent bipartite graph in the real world. Most of the unipartite graph clustering methods have been researched but few of the bipartite graph. The bipartite graph clustering methods have been implemented by the unipartite folding. But this approach results in lack of link information, and existing approaches have a large computation orders. In this paper, we propose the bipartite clustering by TSP solution. We propose three cost function definitions with vertex adjacency vectors. Then, we apply the solution to computer-generated graphs with Local Clustering Organization(LCO). As results of the experiment, we obtained clusters by cutting high cost threshold, and we found that the cost function based on cosine construct better clusters.