Predicting missing links and their weights via reliable-route-based method
Not on the map. Why?
Abstract (arXiv)
Link prediction aims to uncover missing links or predict the emergence of future relationships according to the current networks structure. Plenty of algorithms have been developed for link prediction in unweighted networks, with only a very few of them having been extended to weighted networks. Thus far, how to predict weights of links is important but rarely studied. In this Letter, we present a reliable-route-based method to extend unweighted local similarity indices to weighted indices and propose a method to predict both the link existence and link weights accordingly. Experiments on different real networks suggest that the weighted resource allocation index has the best performance to predict the existence of links, while the reliable-route-based weighted resource allocation index performs noticeably better on weight prediction. Further analysis shows a strong correlation for both link prediction and weight prediction: the larger the clustering coefficient, the higher the prediction accuracy.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Aug 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1.
3 papers.
- 2022DropMessage: Unifying Random Dropping for Graph Neural Networkscited by 29
- 2023Forecasting Irregularly Sampled Time Series using Graphscited by 1
- 2024Haar-Laplacian for directed graphscited by 1
- 2024Haar-Laplacian for directed graphs23 Nov 2024
- 2023Forecasting Irregularly Sampled Time Series using Graphs22 May 2023
- 2022DropMessage: Unifying Random Dropping for Graph Neural Networks21 Apr 2022