Robust Graph Mode Seeking by Graph Shift
| 
53 | 
43 | 
0
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.
还没有评论，说两句吧！
热门资源
Stratified Strate...
In this paper we introduce Stratified Strategy ...
The Variational S...
Unlike traditional images which do not offer in...
Learning to learn...
The move from hand-designed features to learned...
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Learning to Predi...
Much of model-based reinforcement learning invo...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
