.png){kind=icon}
.png){kind=icon}
Return
Path-based estimation for link prediction
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-021-01312-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Link prediction has received a great deal of attention from researchers. Most of the existing researches are based on the network topology but ignore the importance of its preference; for aggregating multiple pieces of information, they normally sum up them directly. In this paper, a path-based probabilistic model is proposed to estimate the potential connectivity between any two nodes. It takes carefully the effective influence of nodes and the dependency among paths between two fixed nodes into account. Furthermore, we formulate the connectivity of two inner-community nodes and that of two inter-community nodes. The qualitative analysis shows that the links between inner-community nodes are more likely to be predicted by the proposed model. The performance is verified on both the multi-barbell network and Lesmis network. Considering the proposed model's practicability, we develop an algorithm that iterates over the adjacent matrix to simulate paths of different lengths, with the parameters automatically grid-searched. The results of the experiments show that the proposed model outperforms competitive methods.
Keywords:
Link prediction
Preferential attachment
Community structure
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
3.1K
Citations:
5.6K