Location of Repository

Robust Graph Mode Seeking by Graph Shift

By Hairong Liu and Shuicheng Yan

Abstract

In this paper, we study how to robustly compute the modes of a graph, namely the dense subgraphs, which characterize the underlying compact patterns and are thus useful for many applications. We first define the modes based on graph density function, then propose the graph shift algorithm, which starts from each vertex and iteratively shifts towards the nearest mode of the graph along a certain trajectory. Both theoretic analysis and experiments show that graph shift algorithm is very efficient and robust, especially when there exist large amount of noises and outliers. 1

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.170.1533
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.icml2010.org/papers... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.