Abstract:Bipartite network is a performance of complex networks, the divided of unilateral node of bipartite network has important practical significance for the study of complex networks of community division. Based on the idea of information transfer probability, this paper presents a community of bipartite network divided clustering algorithm (IPS algorithm). The algorithm simulates the probability of information transfer in the network, through mutual support value between the nodes in network.select the max value as the basis for merger different communities and introduction of bipartite network module as a basis for judging the merits of community division. Finally, we using actual network test the performance of the algorithm. Experimental results show that the algorithm can not only accurate divided the unilateral node of bipartite network, but also can get high quality community division.