Significance-Driven Graph Clustering

DOI10.1007/978-3-540-72870-2_2MaRDI QIDQ5434419zbMATH OpenOpenAlexFDO

Authors Marco Gaertler, Robert Görke, Dorothea Wagner

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72870-2_2

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On Finding Graph Clusterings with Maximum Modularity
• A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
• Axioms for graph clustering quality functions
• On the statistical detection of clusters in undirected networks
• A partitioning-based divisive clustering technique for maximizing the modularity

Cited in

(12)

• On the statistical detection of clusters in undirected networks
• Graph clustering based on modularity variation estimations
• A characterization of modularity in graphs
• Axioms for graph clustering quality functions
• Community detection based on significance optimization in complex networks
• Some properties of E-quality function for network clustering
• Computational aspects of lucidity-driven graph clustering
• On Finding Graph Clusterings with Maximum Modularity
• Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
• Assessing the quality of multilevel graph clustering
• A Statistical Performance Analysis of Graph Clustering Algorithms
• Modularity-maximizing graph communities via mathematical programming

This page was built for publication: Significance-Driven Graph Clustering

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