Reformulation of a model for hierarchical divisive graph modularity maximization

DOI10.1007/S10479-012-1286-ZzbMATH1303.90111OpenAlexW2024996305MaRDI QIDQ490216FDOQ490216

Authors Sonia Cafieri, Pierre Hansen, Alberto 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)

Recommendations

• Divisive heuristic for modularity density maximization
• A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
• A partitioning-based divisive clustering technique for maximizing the modularity
• A cutting plane algorithm for modularity maximization problem
• scientific article; zbMATH DE number 6180551

Cites work

• scientific article; zbMATH DE number 2084315 (Why is no real title available?)
• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• A cutting plane algorithm for a clustering problem
• Collective dynamics of `small-world' networks
• Community structure in social and biological networks
• Compact mathematical formulation for graph partitioning
• Finding community structures in complex networks using mixed integer optimisation
• Linear and quadratic programming approaches for the general graph partitioning problem
• Modularity-maximizing graph communities via mathematical programming
• Networks. An introduction.
• On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems

Cited in

(13)

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

Describes a project that uses

Uses Software

• GraphBase
• Pajek
• CPLEX
• Pajek datasets

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

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