A comprehensive survey of link prediction methods

Arrar, Djihad; Kamel, Nadjet; Lakhfif, Abdelaziz

doi:10.1007/s11227-023-05591-8

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article4

Book1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 11 publications

References 124 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A Fast Parallel Approach for Neighborhood‐Based Link Prediction by Disregarding Large Hubs

Sahu,

Kothapalli

2024

Concurrency and Computation

View full text Add to dashboard Cite

Link prediction can help rectify inaccuracies in various graph algorithms, stemming from unaccounted‐for or overlooked links within networks. However, many existing works use a baseline approach, which incurs unnecessary computational costs due to its high time complexity. Further, many studies focus on smaller graphs, which can lead to misleading conclusions. Here, we study the prediction of links using neighborhood‐based similarity measures on large graphs. In particular, we improve upon the baseline approach (IBase), and propose a heuristic approach that additionally disregards large hubs (DLH), based on the idea that high‐degree nodes contribute little similarity among their neighbors. On a server equipped with dual 16‐core Intel Xeon Gold 6226R processors, DLH is on average faster than IBase, especially on web graphs and social networks, while maintaining similar prediction accuracy. Notably, DLH achieves a link prediction rate of 38.1M edges/s and improves performance by for every doubling of threads.

show abstract