|
|||||
|
|
Multiple graphs clustering by gradient flow method |
|
| Authors: | Hong Zhu Chuan Chen Li-Zhi Liao Michael K Ng |
| Institution: | 1. Faculty of Science, Jiangsu University, Zhenjiang, Jiangsu 212013, China;2. School of Data and Computer Science, Sun Yat-Sen University, Guangzhou, Guangdong 510006, China;3. Department of Mathematics, Hong Kong Baptist University, Hong Kong, China |
| Abstract: | 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. |
| Keywords: | Corresponding author |
| 本文献已被 ScienceDirect 等数据库收录！ | |