Community detection using restrained random-walk similarity

M Okuda, S Satoh, Y Sato… - IEEE transactions on …, 2019 - ieeexplore.ieee.org
In this paper, we propose a restrained random-walk similarity method for detecting the
community structures of graphs. The basic premise of our method is that the starting vertices
of finite-length random walks are judged to be in the same community if the walkers pass
similar sets of vertices. This idea is based on our consideration that a random walker tends
to move in the community including the walker's starting vertex for some time after starting
the walk. Therefore, the sets of vertices passed by random walkers starting from vertices in …

[CITATION][C] Community detection using restrained random-walk similarity.[j]

O Makoto, S Shin'ichi, S Yoichi, K Yutaka - IEEE transactions on pattern analysis and …, 2019
Showing the best results for this search. See all results