Link Prediction in Complex Networks Using Average Centrality-Based Similarity Score

NANDINI, Y.V., LAKSHMI, T. Jaya, ENDURI, Murali Krishna and SHARMA, Hemlata (2024). Link Prediction in Complex Networks Using Average Centrality-Based Similarity Score. Entropy, 26 (6): 433. [Article]

Documents
33755:642893
[thumbnail of Sharma-LinkPredictionComplex(VoR).pdf]
Preview
PDF
Sharma-LinkPredictionComplex(VoR).pdf - Published Version
Available under License Creative Commons Attribution.

Download (2MB) | Preview
Abstract
Link prediction plays a crucial role in identifying future connections within complex networks, facilitating the analysis of network evolution across various domains such as biological networks, social networks, recommender systems, and more. Researchers have proposed various centrality measures, such as degree, clustering coefficient, betweenness, and closeness centralities, to compute similarity scores for predicting links in these networks. These centrality measures leverage both the local and global information of nodes within the network. In this study, we present a novel approach to link prediction using similarity score by utilizing average centrality measures based on local and global centralities, namely Similarity based on Average Degree (
More Information
Statistics

Downloads

Downloads per month over past year

View more statistics

Metrics

Altmetric Badge

Dimensions Badge

Share
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Actions (login required)

View Item View Item