Freeman, L.C. (2003) Finding Social Groups: A Meta-Analysis of the Southern Women Data. In: Breiger, R., Carley, C. and Pattison, P., Eds., Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers, National Research Council, The National Academies Press, Washington DC, 39-97.

has been cited by the following article:

• TITLE: Mathematical Model and Algorithm for Link Community Detection in Bipartite Networks

  AUTHORS: Zhenping Li, Shihua Zhang, Xiangsun Zhang

  KEYWORDS: Bipartite Network, Link Community, Quantity Function, Integer Programming, Genetic Algorithm

  JOURNAL NAME: American Journal of Operations Research, Vol.5 No.5, September 22, 2015

  ABSTRACT: In the past ten years, community detection in complex networks has attracted more and more attention of researchers. Communities often correspond to functional subunits in the complex systems. In complex network, a node community can be defined as a subgraph induced by a set of nodes, while a link community is a subgraph induced by a set of links. Although most researches pay more attention to identifying node communities in both unipartite and bipartite networks, some researchers have investigated the link community detection problem in unipartite networks. But current research pays little attention to the link community detection problem in bipartite networks. In this paper, we investigate the link community detection problem in bipartite networks, and formulate it into an integer programming model. We proposed a genetic algorithm for partition the bipartite network into overlapping link communities. Simulations are done on both artificial networks and real-world networks. The results show that the bipartite network can be efficiently partitioned into overlapping link communities by the genetic algorithm.