A Statistical Performance Analysis of Graph Clustering Algorithms

DOI10.1007/978-3-319-92871-5_11OpenAlexW2805369415MaRDI QIDQ5881233

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

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

graph clusteringconnectivity patternsclustering performance measureinter-cluster connectivitystress test scenarios

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (2)

Graph clustering with Boltzmann machines ⋮ Graph Clustering Via Intra-Cluster Density Maximization

Uses Software

• VNDS
• LPAm+
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• When are networks truly modular?
• Modularity in several random graph models
• Modularity of complex networks models
• A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning

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