Volume 89, Number 5, March 2010
|Number of page(s)||6|
|Section||Interdisciplinary Physics and Related Areas of Science and Technology|
|Published online||30 March 2010|
Link prediction based on local random walk
Department of Physics, University of Fribourg - Chemin du Musée 3, CH-1700 Fribourg, Switzerland
Corresponding author: firstname.lastname@example.org
Accepted: 3 March 2010
The problem of missing link prediction in complex networks has attracted much attention recently. Two difficulties in link prediction are the sparsity and huge size of the target networks. Therefore, to design an efficient and effective method is of both theoretical interest and practical significance. In this letter, we proposed a method based on local random walk, which can give competitively good or even better prediction than other random-walk–based methods while having a much lower computational complexity.
PACS: 89.20.Ff – Computer science and technology / 89.75.Hc – Networks and genealogical trees / 89.65.-s – Social and economic systems
© EPLA, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.