%0 Journal Article %A ZHANG Xiaoqin %A LIU Linan %T Bipartite Network Community Detecting Algorithm Based on Intimacy and Attraction %D 2019 %R 10.3778/j.issn.1002-8331.1808-0090 %J Computer Engineering and Applications %P 170-176 %V 55 %N 23 %X Community division is a hot topic in the study of bipartite network, aiming at the existing bipartite network community detecting algorithm from different nodes with the problem of low accuracy, this paper proposes the bipartite network community detecting algorithm based on Intimacy and Attraction Algorithm(IAA). The algorithm treats every U-type node as a community, through calculating the intimacy of each community and the attraction of the community merge communities, U-type node partition is obtained. At last, V-type nodes are divided into existing communities to obtain complete community division results. Through the analysis on artificial networks and real-world networks, normalized mutual information and modularity are used respectively as evaluation indicators. The experimental results show that IAA is able to mine the bipartite network community structure more effectively and has a better community division. %U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1808-0090