.png){kind=icon}
.png){kind=icon}
Return
A convergence theorem for graph shift-type algorithms
.png){kind=icon}
OA
AI
DOI：10.1016/j.patcog.2015.02.013.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Robust Graph mode seeking by Graph Shift (Liu and Tan, 2010) (RGGS) algorithm represents a recent promising approach for discovering dense subgraphs in noisy data. However, there are no theoretical foundations for proving the convergence of the RGGS algorithm, leaving the question as to whether an algorithm works for solid reasons. In this paper, we propose a generic theoretical framework consisting of three key Graph Shift (GS) components: the simplex of a generated sequence set, the monotonic and continuous objective function and closed mapping. We prove that the GS-type algorithms built on such components can be transformed to fit Zangwill's theory, and the sequence set generated by the GS procedures always terminates at a local maximum, or at worst, contains a subsequence which converges to a local maximum of the similarity measure function. The framework is verified by theoretical analysis and experimental results of several typical GS-type algorithms. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Convergence proof
The Robust Graph mode seeking by Graph
Shift (RGGS) algorithm
Dominant Sets
Pairwise Clustering
Zangwill's theory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W