Correcting for granularity bias in modularity-based community detection methods

DOI10.1007/978-3-031-32296-9_1MaRDI QIDQ6057286zbMATH OpenFDO

Authors Martijn Gösgens, Remco van der Hofstad, Nelly Litvak

Publication date 4 October 2023

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

Full work available at URL https://doi.org/10.1007/978-3-031-32296-9_1

zbMATH Keywords

clusteringcommunity detectionlikelihood maximizationmodularity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Efficient modularity density heuristics for large graphs
• A modularity degree based heuristic community detection algorithm
• Bad communities with high modularity
• Finding network communities using modularity density
• On Finding Graph Clusterings with Maximum Modularity

Cites work

• Fast unfolding of communities in large networks
• Modularity of complex networks models
• Modularity of Erdős-Rényi random graphs
• Modularity of the ABCD random graph model with community structure
• On the modularity of 3‐regular random graphs and random graphs with given degree sequences

This page was built for publication: Correcting for granularity bias in modularity-based community detection methods

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