Multiple graphs clustering by gradient flow method

Abstract

© 2017 The core issue of multiple graphs clustering is to find clusters of vertices from graphs such that these clusters are well-separated in each graph and clusters are consistent across different graphs. The problem can be formulated as a multiple orthogonality constrained optimization model which can be shown to be a relaxation of a multiple graphs cut problem. The resulting optimization problem can be solved by a gradient flow iterative method. The convergence of the proposed iterative scheme can be established. Numerical examples are presented to demonstrate the effectiveness of the proposed method for solving multiple graphs clustering problems in terms of clustering accuracy and computational efficiency.