Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T08:51:07.001Z Has data issue: false hasContentIssue false

Is it correct to project and detect? How weighting unipartite projections influences community detection

Published online by Cambridge University Press:  17 April 2020

Tristan J. B. Cann*
Affiliation:
College of Engineering, Mathematics and Physical Sciences, Harrison Building, Streatham Campus, University of Exeter, North Park Road, Exeter, EX4 4QF, UK (e-mails: i.s.weaver@exeter.ac.uk, h.t.p.williams@exeter.ac.uk)
Iain S. Weaver
Affiliation:
College of Engineering, Mathematics and Physical Sciences, Harrison Building, Streatham Campus, University of Exeter, North Park Road, Exeter, EX4 4QF, UK (e-mails: i.s.weaver@exeter.ac.uk, h.t.p.williams@exeter.ac.uk)
Hywel T. P. Williams
Affiliation:
College of Engineering, Mathematics and Physical Sciences, Harrison Building, Streatham Campus, University of Exeter, North Park Road, Exeter, EX4 4QF, UK (e-mails: i.s.weaver@exeter.ac.uk, h.t.p.williams@exeter.ac.uk)
*
*Corresponding author. Email: tc471@exeter.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Bipartite networks represent pairwise relationships between nodes belonging to two distinct classes. While established methods exist for analyzing unipartite networks, those for bipartite network analysis are somewhat obscure and relatively less developed. Community detection in such instances is frequently approached by first projecting the network onto a unipartite network, a method where edges between node classes are encoded as edges within one class. Here we test seven different projection schemes by assessing the performance of community detection on both: (i) a real-world dataset from social media and (ii) an ensemble of artificial networks with prescribed community structure. A number of performance and accuracy issues become apparent from the experimental findings, especially in the case of long-tailed degree distributions. Of the methods tested, the “hyperbolic” projection scheme alleviates most of these difficulties and is thus the most robust scheme of those tested. We conclude that any interpretation of community detection algorithm performance on projected networks must be done with care as certain network configurations require strong community preference for the bipartite structure to be reflected in the unipartite communities. Our results have implications for the analysis of detected community structure in projected unipartite networks.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© Cambridge University Press 2020
Supplementary material: File

Cann et al. supplementary material

Cann et al. supplementary material 1

Download Cann et al. supplementary material(File)
File 30.7 KB
Supplementary material: File

Cann et al. supplementary material

Cann et al. supplementary material 2

Download Cann et al. supplementary material(File)
File 53.3 KB
Supplementary material: File

Cann et al. supplementary material

Cann et al. supplementary material 3

Download Cann et al. supplementary material(File)
File 17 KB