Graph Clustering Via Intra-Cluster Density Maximization

DOI10.1007/978-3-030-37157-9_3zbMath1443.91245OpenAlexW3008744263MaRDI QIDQ3294900

Anthony J. Bonner, Yuri Lawryshyn, Leonidas S. Pitsoulis, Pierre Miasnikof, Panos M. Pardalos

Publication date: 29 June 2020

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-37157-9_3

zbMATH Keywords

combinatorial optimizationgraph clusteringnetwork community detection

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Combinatorial optimization (90C27)

Related Items (1)

Graph clustering with Boltzmann machines

Uses Software

• VNDS
• LPAm+
• DIMACS
• ElemStatLearn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast community detection by SCORE
• Community detection by modularity maximization using GRASP with path relinking
• Graph clustering
• Modularity in several random graph models
• Linear and quadratic programming approaches for the general graph partitioning problem
• Modularity of complex networks models
• Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
• A Statistical Performance Analysis of Graph Clustering Algorithms

This page was built for publication: Graph Clustering Via Intra-Cluster Density Maximization