Distributed community detection: Finding neighborhoods in a complex world using synthetic coordinates

Authors:
H. Papadakis;P. Fragopoulou;C. Panagiotakis
Affiliations:
Dept. of Appl. Inf. & Multimedia, Technol. Educ. Inst. of Crete, Heraklion, Greece;Dept. of Appl. Inf. & Multimedia, Technol. Educ. Inst. of Crete, Heraklion, Greece;Dept. of Commerce & Marketing, Technol. Educ. Inst. of Crete, Heraklion, Greece
Venue:
ISCC '11 Proceedings of the 2011 IEEE Symposium on Computers and Communications
Year:
2011

Citing 0
Cited 2

Evolution of User Activity and Community Formation in an Online Social Network

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Locating communities on graphs with variations in community sizes

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an algorithm that finds the entire community structure of a network, based on local interactions between neighboring nodes and on an unsupervised centralized clustering algorithm. The novelty of the proposed approach is the fact that the algorithm is based on the use of network coordinates computed by a distributed algorithm. The current paper not only presents an efficient distributed community finding algorithm, but also demonstrates that network coordinates could be used to derive efficient solutions to a variety of problems. Experimental results and comparisons with other methods from literature are presented for a variety of benchmark graphs with known community structure, derived by varying a number of graph parameters.