A fast community detection method in bipartite networks by distance dynamics

Sun, Hong-Liang, Ch'ng, Eugene, Yong, Xi, Garibaldi, Jonathan M., See, Simon and Chen, Duan-Bing (2018) A fast community detection method in bipartite networks by distance dynamics. Physica A: Statistical Mechanics and its Applications, 496 . pp. 108-120. ISSN 0378-4371

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview


Many real bipartite networks are found to be divided into two-mode communities. In this paper, we formulate a new two-mode community detection algorithm BiAttractor. It is based on distance dynamics model Attractor proposed by Shao et al. with extension from unipartite to bipartite networks. Since Jaccard coefficient of distance dynamics model is incapable to measure distances of different types of vertices in bipartite networks, our main contribution is to extend distance dynamics model from unipartite to bipartite networks using a novel measure Local Jaccard Distance (LJD). Furthermore, distances between different types of vertices are not affected by common neighbors in the original method. This new idea makes clear assumptions and yields interpretable results in linear time complexity O(jEj) in sparse networks, where jEj is the number of edges. Experiments on synthetic networks demonstrate it is capable to overcome resolution limit compared with existing other methods. Further research on real networks shows that this model can accurately detect interpretable community structures in a short time.

Item Type: Article
Keywords: Node similarity; Community detection; Large bipartite networks
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1016/j.physa.2017.12.099
Depositing User: Eprints, Support
Date Deposited: 21 Dec 2017 12:06
Last Modified: 30 Dec 2018 04:30
URI: https://eprints.nottingham.ac.uk/id/eprint/48844

Actions (Archive Staff Only)

Edit View Edit View