PUMA
Istituto di Informatica e Telematica     
Gregori E., Mainardi S., Lenzini L. Parallel $(k)$-Clique Community Detection on Large-Scale Networks. In: IEEE Transactions on Parallel and Distributed Systems, vol. 24 (8) pp. 1651 - 1666. IEEE, 2013.
 
 
Abstract
(English)
The analysis of real-world complex networks has been the focus of recent research. Detecting communities helps in uncovering their structural and functional organization. Valuable insight can be obtained by analyzing the dense, overlapping, and highly interwoven k-clique communities. However, their detection is challenging due to extensive memory requirements and execution time. In this paper, we present a novel, parallel k-clique community detection method, based on an innovative technique which enables connected components of a network to be obtained from those of its subnetworks. The novel method has an unbounded, user-configurable, and input-independent maximum degree of parallelism, and hence is able to make full use of computational resources. Theoretical tight upper bounds on its worst case time and space complexities are given as well. Experiments on real-world networks such as the Internet and the World Wide Web confirmed the almost optimal use of parallelism (i.e., a linear speedup). Comparisons with other state-of-the-art k-clique community detection methods show dramatic reductions in execution time and memory footprint. An open-source implementation of the method is also made publicly available.
Subject Sparse matrices
Program processors
Parallel processing
parallel community
optimization
k-clique communities
Internet
detection method
Complexity theory
Communities
C.2.1 Network Architecture and Design: wireless communication


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional