A framework for joint community detection across multiple related networks

• Published in: Neurocomputing (Amsterdam) Vol. 76; no. 1; pp. 93 - 104
• Main Authors: Mandayam Comar, Prakash, Tan, Pang-Ning, Jain, Anil K.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 15-01-2012
• Subjects: Communities; Community detection; Factorization; Graphs; Link mining; Networks; On-line systems; Social networks; Websites; Community detection; Social networks; Link mining
• ISSN: 0925-2312; 1872-8286
• DOI: 10.1016/j.neucom.2011.04.035

Community detection in networks is an active area of research with many practical applications. However, most of the early work in this area has focused on partitioning a single network or a bipartite graph into clusters/communities. With the rapid proliferation of online social media, it has become increasingly common for web users to have noticeable presence across multiple web sites. This raises the question whether it is possible to combine information from several networks to improve community detection. In this paper, we present a framework that identifies communities simultaneously across different networks and learns the correspondences between them. The framework is applicable to networks generated from multiple web sites as well as to those derived from heterogeneous nodes of the same web site. It also allows the incorporation of prior information about the potential relationships between the communities in different networks. Extensive experiments have been performed on both synthetic and real-life data sets to evaluate the effectiveness of our framework. Our results show superior performance of simultaneous community detection over three alternative methods, including normalized cut and matrix factorization on a single network or a bipartite graph.