Comparing different modularization criteria using relational metric

DOI10.1007/978-3-642-40020-9_18MaRDI QIDQ5410532zbMATH OpenOpenAlexFDO

Authors P. Conde Céspedes, Jean-François Marcotorchino

Publication date 16 April 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40020-9_18

zbMATH Keywords

clusteringcommunitiesgraphmathematical relational analysismodularitymodularizationmodularization function

Mathematics Subject Classification ID

Information theory (general) (94A15)

Recommendations

• Comparison of linear modularization criteria using the relational formalism, an approach to easily identify resolution limit
• Bad communities with high modularity
• A nonparametric view of network models and Newman–Girvan and other modularities
• Modularity-maximizing graph communities via mathematical programming
• scientific article; zbMATH DE number 6180551

Cited in

(3)

• Comparison of linear modularization criteria using the relational formalism, an approach to easily identify resolution limit
• Equivalence relations for modular performance evaluation in dtsPBC
• Fast unfolding of communities in large networks: 15 years later

This page was built for publication: Comparing different modularization criteria using relational metric

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