2026-06-29T07:50:31Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/230212024-11-25T16:28:05Zcom_20.500.14352_14col_20.500.14352_15

A Divide-and-Link algorithm for hierarchical clustering in networks Gómez González, Daniel Zarrazola Rivera, Edwin Yáñez Gestoso, Francisco Javier Montero De Juan, Francisco Javier 519.8 Networks Clustering Hierarchical clustering Social networks analysis Investigación operativa (Matemáticas) 1207 Investigación Operativa 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. Comunidad de Madrid Gobierno de España Universidad Complutense de Madrid Depto. de Estadística e Investigación Operativa Fac. de Ciencias Matemáticas TRUE inpress 2023-06-18T05:41:02Z 2023-06-18T05:41:02Z 2015-04-17 journal article https://hdl.handle.net/20.500.14352/23021 0020-0255 10.1016/j.ins.2015.04.011 eng (S2013/ICCE-2845) (TIN2012-32482) Research Group ( 910149) 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 restricted access application/pdf Elsevier Science Inc