Graph clustering via intra-cluster density maximization

DOI10.1007/978-3-030-37157-9_3MaRDI QIDQ3294900zbMATH OpenOpenAlexFDO

Authors Pierre Miasnikof, Leonidas Pitsoulis, Anthony J. Bonner, Yuri Lawryshyn, 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

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

Recommendations

• MILP formulations for the modularity density maximization problem
• Density-constrained graph clustering
• Graph clustering
• Engineering graph clustering: models and experimental evaluation
• On Finding Graph Clusterings with Maximum Modularity

Cites work

• A Statistical Performance Analysis of Graph Clustering Algorithms
• Community detection by modularity maximization using GRASP with path relinking
• Fast community detection by SCORE
• Graph clustering
• scientific article; zbMATH DE number 176065 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 6180551 (Why is no real title available?)
• Linear and quadratic programming approaches for the general graph partitioning problem
• Modularity in several random graph models
• Modularity of complex networks models
• Robust optimization of graph partitioning and critical node detection in analyzing networks

Cited in

(6)

• Optimal Fuzzy Aggregation of Networks
• scientific article; zbMATH DE number 2043371 (Why is no real title available?)
• Clustering, community partition and disjoint spanning trees
• Dynamic graph clustering combining modularity and smoothness
• Finding and visualizing graph clusters using PageRank optimization
• Graph clustering with Boltzmann machines

Describes a project that uses

Uses Software

• VNDS
• LPAm+
• DIMACS
• ElemStatLearn

This page was built for publication: Graph clustering via intra-cluster density maximization

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