Link Prediction Model for Weighted Networks Based on Evidence Theory and the Influence of Common Neighbours

Table 1

Symbols used and their meanings.

Symbolic representation	Description
G = (V,E,W)	Graph of an undirected weighted network
V	Node set. V = {,,…,}, |V| = n
E	Edge set. E = {e(i, j)| , ∈V, i j}, |E| = m
W	Weight set. W = { (i,j)| , ∈V, i j}
U	Collection of links in the complete graph of G
(x,y)	Edge weight value between nodes and
kx	Degree of node
sx	Sum of the weights of all edges connected to node
Γ1(x)	The first-order neighbour set of node
Γ2(x)	The second-order neighbour set of node
Sx,y	Similarity between nodes and
CCN	Current common neighbour
FCN	Future common neighbour
EWI	Endpoint weight influence
LWI	Link weight influence
HSNI	High-strength node influence
	Node influence based on CCNs
	Node influence based on FCNs
	Total similarity based on the influence of CCNs and FCNs
	Similarity based on DS and the influence of all common neighbours