Information filtering based on transferring similarity
Sun, DuoDepartment of Modern Physics and Nonlinear Science Center, University of Science and Technology of China, Hefe, China
Zhou, TaoDepartment of Modern Physics and Nonlinear Science Center, University of Science and Technology of China, Hefe, China - Department of Physics, University of Fribourg, Switzerland
Liu, Jian-GuoDepartment of Modern Physics and Nonlinear Science Center, University of Science and Technology of China, Hefe, China - Department of Physics, University of Fribourg, Switzerland
Liu, Run-RanDepartment of Modern Physics and Nonlinear Science Center, University of Science and Technology of China, Hefe, China
Jia, Chun-XiaoDepartment of Modern Physics and Nonlinear Science Center, University of Science and Technology of China, Hefe, China
Wang, Bing-HongDepartment of Modern Physics and Nonlinear Science Center, University of Science and Technology of China, Hefe, China - Research Center for Complex System Science, University of Shanghai for Science and Technology, Shanghai, China
English
n this Brief Report, we propose an index of user similarity, namely, the transferring similarity, which involves all high-order similarities between users. Accordingly, we design a modified collaborative filtering algorithm, which provides remarkably higher accurate predictions than the standard collaborative filtering. More interestingly, we find that the algorithmic performance will approach its optimal value when the parameter, contained in the definition of transferring similarity, gets close to its critical value, before which the series expansion of transferring similarity is convergent and after which it is divergent. Our study is complementary to the one reported in [E. A. Leicht, P. Holme, and M. E. J. Newman, Phys. Rev. E 73, 026120 (2006)], and is relevant to the missing link prediction problem.