A CUTTING PLANE ALGORITHM FOR MODULARITY MAXIMIZATION PROBLEM
キーワード:
Combinatorial optimization,
community detection,
modularity maximization,
set partitioning,
cutting planes
2017 年 60 巻 1 号 p. 24-42
詳細
2017 年 60 巻 1 号 p. 24-42
Modularity proposed by Newman and Girvan is the most commonly used measure when the nodes of a graph are grouped into communities consisting of tightly connected nodes. We formulate the modularity maximization problem as a set partitioning problem, and propose an algorithm for the problem based on the linear programming relaxation. We solve the dual of the linear programming relaxation by using a cutting plane method. To mediate the slow convergence that cutting plane methods usually suffer, we propose a method for finding and simultaneously adding multiple cutting planes.
