%0 Journal Article
%A LIU Heng
%A KOU Yue
%A SHEN Derong
%A WANG Taiming
%A YU Ge
%T Distributed SimRank Algorithm Based on Random Walk Path
%D 2014
%R 10.3778/j.issn.1673-9418.1405053
%J Journal of Frontiers of Computer Science & Technology
%P 1422-1431
%V 8
%N 12
%X SimRank is a widely used model for computing similarity, it measures similarity between objects based on graph topology. With the rapid increase of data, the way of centralized SimRank is not applicable and current distributed SimRank approaches have some drawbacks in efficiency and scalability. This paper presents a two-stage distributed SimRank algorithm based on random walk path. The first stage is data preprocessing and a Find-K-Paths algorithm based on BSP (bulk synchronous parallel) model is proposed. The algorithm can effectively build the index information of random walk path and support the dynamic adding of new paths. The number of the generated paths can be reduced by threshold filtering. In the second stage, based on the index information, a distributed SimRank algorithm is proposed under MapReduce. The experiments demonstrate the feasibility and effectiveness of the proposed algorithm.
%U http://fcst.ceaj.org/EN/10.3778/j.issn.1673-9418.1405053