A convergence theorem for graph shift-type algorithms

作者：

Highlights：

• We theoretically analyze the behaviors of the RGGS algorithm.

• We prove that the RGGS algorithm is convergent with Zangwill׳s theory.

• A convergence proof framework is built to apply to other GS-type algorithms.

摘要

Highlights•We theoretically analyze the behaviors of the RGGS algorithm.•We prove that the RGGS algorithm is convergent with Zangwill׳s theory.•A convergence proof framework is built to apply to other GS-type algorithms.

论文关键词：Convergence proof,The Robust Graph mode seeking by Graph Shift (RGGS) algorithm,Dominant Sets,Pairwise Clustering,Zangwill׳s theory

论文评审过程：Received 13 January 2014, Revised 19 January 2015, Accepted 18 February 2015, Available online 27 February 2015.

论文官网地址：https://doi.org/10.1016/j.patcog.2015.02.013