A Statistical Performance Analysis of Graph Clustering Algorithms

DOI10.1007/978-3-319-92871-5_11MaRDI QIDQ5881233zbMATH OpenOpenAlexFDO

Authors Pierre Miasnikof, Alexander Y. Shestopaloff, Anthony J. Bonner, Yuri Lawryshyn

Publication date 9 March 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-319-92871-5_11

zbMATH Keywords

clustering performance measureconnectivity patternsgraph clusteringinter-cluster connectivitystress test scenarios

Mathematics Subject Classification ID

Statistics (62-XX)

Recommendations

• Graph clustering
• Significance-Driven Graph Clustering
• Engineering graph clustering: models and experimental evaluation
• On Finding Graph Clusterings with Maximum Modularity
• Engineering Comparators for Graph Clusterings

Cites work

• A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
• High quality graph partitioning
• scientific article; zbMATH DE number 6180551 (Why is no real title available?)
• Modularity in several random graph models
• Modularity of complex networks models
• Significance testing in clustering
• Using graph partitioning for efficient network modularity optimization
• When are networks truly modular?

Cited in

(4)

• Performance analysis of hierarchical clustering algorithms
• Graph clustering via intra-cluster density maximization
• Assessing the Performance of a Graph-Based Clustering Algorithm
• Graph clustering with Boltzmann machines

Describes a project that uses

Uses Software

• VNDS
• LPAm+
• DIMACS

This page was built for publication: A Statistical Performance Analysis of Graph Clustering Algorithms

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