Axioms for graph clustering quality functions

zbMATH Open1318.62222arXiv1308.3383MaRDI QIDQ2933983FDOQ2933983

Authors: Twan van Laarhoven, Elena Marchiori 

Publication date: 8 December 2014

Full work available at URL: https://arxiv.org/abs/1308.3383

Recommendations

• On Finding Graph Clusterings with Maximum Modularity
• Significance-Driven Graph Clustering
• Some properties of E-quality function for network clustering
• A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
• Bad communities with high modularity

zbMATH Keywords

clusteringmodularityaxiomatic framework

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cited In (11)

• Significance-Driven Graph Clustering
• Wide gaps and Kleinberg's clustering axioms for \(k\)-means
• On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior
• Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach
• An axiomatic approach to community detection
• Richness fallacy
• Some properties of E-quality function for network clustering
• Computational aspects of lucidity-driven graph clustering
• Data exploration by representative region selection: axioms and convergence
• Assessing the quality of multilevel graph clustering
• Detecting communities is hard (and counting them is even harder)

This page was built for publication: Axioms for graph clustering quality functions

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