Some properties of E-quality function for network clustering

DOI10.2298/YJOR191215031DzbMATH Open1474.90081OpenAlexW3094858377MaRDI QIDQ3388944FDOQ3388944

Authors: Dušsan Džamić 

Publication date: 7 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor191215031d

Recommendations

• Axioms for graph clustering quality functions
• Significance-Driven Graph Clustering
• On Finding Graph Clusterings with Maximum Modularity
• Bad communities with high modularity
• An algebraic analysis of the graph modularity

zbMATH Keywords

clusteringcomplex networksequality function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Cites Work

• Fast unfolding of communities in large networks
• On Finding Graph Clusterings with Maximum Modularity
• Community detection by modularity maximization using GRASP with path relinking
• Memetic graph clustering
• Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
• Exponential quality function for community detection in complex networks

Cited In (1)

• Axioms for graph clustering quality functions

This page was built for publication: Some properties of E-quality function for network clustering

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