RT Journal Article
T1 A Divide-and-Link algorithm for hierarchical clustering in networks
A1 Gómez González, Daniel
A1 Zarrazola Rivera, Edwin
A1 Yáñez Gestoso, Francisco Javier
A1 Montero De Juan, Francisco Javier
AB 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.
PB Elsevier  Science Inc
SN 0020-0255
YR 2015
FD 2015-04-17
LK https://hdl.handle.net/20.500.14352/23021
UL https://hdl.handle.net/20.500.14352/23021
LA eng
NO Gómez, D., Zarrazola, E., Yáñez, J., Montero, J.: A Divide-and-Link algorithm for hierarchical clustering in networks. Information Sciences. 316, 308-328 (2015). https://doi.org/10.1016/j.ins.2015.04.011
NO Comunidad de Madrid
NO Gobierno de España
NO Universidad Complutense de Madrid
DS Docta Complutense
RD 8 abr 2025