A Divide-and-Link algorithm for hierarchical clustering in networks



Downloads per month over past year

Gomez, D. and Zarrazola Rivera, Edwin and Yáñez, Javier and Montero, Javier (2015) A Divide-and-Link algorithm for hierarchical clustering in networks. Information Sciences . ISSN 0020-0255 (In Press)

[thumbnail of Montero130.pdf] PDF
Restringido a Repository staff only


Official URL: http://www.sciencedirect.com/science/article/pii/S0020025515002790


This paper introduces a hierarchical clustering algorithm in networks based upon a first divisive stage to break the graph and a second linking stage which is used to join nodes. As a particular case, this algorithm is applied to the specific problem of community detection in social networks, where a betweenness measure is considered for the divisive criterion and a similarity measure associated to data is used for the linking criterion. We show that this algorithm is very flexible as well as quite competitive (from both a performance and a computational complexity point of view) in relation with a set of state-of-the-art algorithms. Furthermore, the output given by the proposed algorithm allows to show in a dynamic and interpretable way the evolution of how the groups are split in the network.

Item Type:Article
Uncontrolled Keywords:Networks; Clustering; Hierarchical clustering; Social networks analysis
Subjects:Sciences > Mathematics > Operations research
ID Code:29701
Deposited On:23 Apr 2015 06:40
Last Modified:02 Jun 2016 16:45

Origin of downloads

Repository Staff Only: item control page