Parallel overlapping community detection with SLPA

Loading...
Thumbnail Image
Authors
Kuzmin, Konstantin
Issue Date
2014-05
Type
Electronic thesis
Thesis
Language
ENG
Keywords
Computer science
Research Projects
Organizational Units
Journal Issue
Alternative Title
Abstract
In a very general context, communities in networks are defined as groups of nodes that have some common properties such that connections are stronger between the nodes in a community than with the nodes in the rest of the network. It is quite common for nodes to participate in multiple communities. Therefore a community detection algorithm for such applications should be able to detect overlapping communities. However, overlapping community detection is more computationally intensive than disjoint community detection and presents new challenges that algorithm designers have to face. Besides, the big data phenomenon with exabytes of data brings up datasets that take too long to analyze using even the fastest algorithms currently available. Fortunately, the amount of computing power available to researches also increases. This computing power usually comes structured as a number of cores, processors, or machines joined together to form a high performance computer, cluster or a supercomputer. In this thesis we analyze what other researchers have done to utilize high performance computing to perform efficient community detection in social, biological, and other networks. We use the Speaker-listener Label Propagation Algorithm (SLPA) as the basis for our parallel overlapping community detection implementation. SLPA provides near linear time community detection and is well suited for parallelization. We explore the benefits of a multithreaded programming paradigm for both synthetic and real-world networks and show that it yields a significant performance gain over sequential execution in detecting overlapping communities.
Description
May 2014
School of Science
Full Citation
Publisher
Rensselaer Polytechnic Institute, Troy, NY
Terms of Use
Journal
Volume
Issue
PubMed ID
DOI
ISSN
EISSN