Recovering nested structures in networks: an evaluation of hierarchical clustering techniques

DOI10.1093/COMNET/CNAE039MaRDI QIDQ7026697zbMATH OpenFDO

Authors Imre Gera, András London

Publication date 17 February 2025

Published in Journal of Complex Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1093/COMNET/CNAE039

zbMATH Keywords

algorithmscommunity detectiondata mininghierarchical clusteringnestednessnetwork science

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30)

Cites work

• A comparative study of divisive and agglomerative hierarchical clustering algorithms
• Community structure in social and biological networks
• Complex networks: structure and dynamics
• Core-periphery structure in networks
• Graph clustering via generalized colorings
• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• Networks
• Optimal hierarchical clustering on a graph
• Why nestedness in mutualistic networks?

This page was built for publication: Recovering nested structures in networks: an evaluation of hierarchical clustering techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026697)