Reformulation of a model for hierarchical divisive graph modularity maximization

DOI10.1007/s10479-012-1286-zzbMath1303.90111OpenAlexW2024996305MaRDI QIDQ490216

Sonia Cafieri, Pierre Hansen, Alberto L. C. Costa

Publication date: 22 January 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1286-z

zbMATH Keywords

clusteringcompact reformulationdivisive hierarchical heuristicmodularity maximization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Divisive heuristic for modularity density maximization ⋮ A study on modularity density maximization: column generation acceleration and computational complexity analysis ⋮ A locally optimal hierarchical divisive heuristic for bipartite modularity maximization ⋮ Additive approximation algorithms for modularity maximization ⋮ Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization ⋮ Efficient modularity density heuristics for large graphs ⋮ Optimization problems for machine learning: a survey ⋮ Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering ⋮ Modified modularity density maximization and density ratio heuristic ⋮ Maximizing Barber's bipartite modularity is also hard

Uses Software

• GraphBase
• Pajek
• CPLEX
• Pajek datasets

Cites Work

• Unnamed Item
• Unnamed Item
• Compact mathematical formulation for graph partitioning
• Modularity-maximizing graph communities via mathematical programming
• Finding community structures in complex networks using mixed integer optimisation
• A cutting plane algorithm for a clustering problem
• On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
• Linear and quadratic programming approaches for the general graph partitioning problem
• Community structure in social and biological networks
• Collective dynamics of ‘small-world’ networks
• Networks

This page was built for publication: Reformulation of a model for hierarchical divisive graph modularity maximization