Community detection in bipartite networks using weighted symmetric binary matrix factorization

Abstract

In this paper we propose weighted symmetric binary matrix factorization (wSBMF) framework to detect overlapping communities in bipartite networks, which describe relationships between two types of nodes. Our method improves performance by recognizing the distinction between two types of missing edges---ones among the nodes in each node type and the others between two node types. Our method can also explicitly assign community membership and distinguish outliers from overlapping nodes, as well as incorporating existing knowledge on the network. We propose a generalized partition density for bipartite networks as a quality function, which identifies the most appropriate number of communities. The experimental results on both synthetic and real-world networks demonstrate the effectiveness of our method.

International Journal of Modern Physics C (2014)

References in corpus (15)

• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Modularity and community structure in networks
• Community detection in graphs
• The large-scale organization of metabolic networks
• Who is the best connected scientist? A study of scientific coauthorship networks
• Link communities reveal multiscale complexity in networks
• Detecting the overlapping and hierarchical community structure of complex networks
• How to project a bipartite network?
• Modularity and community detection in bipartite networks
• Cycles and clustering in bipartite networks
• Bi-clique Communities
• Overlapping Community Detection in Complex Networks using Symmetric Binary Matrix Factorization
• Community Structure Detection in Complex Networks with Partial Background Information
• New approaches to model and study social networks

Cited by in corpus (4)

• Community Detection in Complex Networks Using Density-based Clustering Algorithm
• The Atlas for the Aspiring Network Scientist
• A New Approach to Detect Important Members that Create the Communities in Bipartite Networks
• On Equivalence of Likelihood Maximization of Stochastic Block Model and Constrained Nonnegative Matrix Factorization