Title: Numerical Algorithms for multiple Graphs Clustering
报告人：Professor Michael Kwok-Po Ng，the Hong Kong Baptist University
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.
Michael Kwok-Po Ng is the Head and Chair Professor of the Department of Mathematics, and Chair Professor (Affiliate) of Department of Computer Science at the Hong Kong Baptist University. He is selected for the 2017 Class of Fellows of the Society for Industrial and Applied Mathematics. At 2017, Michael obtained Feng Kang Prize for his significant contributions in numerical linear algebra for solving structured linear systems, mathematical and computational methods in image processing. He obtained his B.Sc. degree in 1990 and M.Phil. degree in 1992 at the University of Hong Kong, and Ph.D. degree in 1995 at Chinese University of Hong Kong.