The Algorithm of Link Prediction on Social Network

Algorithm 1

CNGF algorithm.

Input: social network graph 𝐺=⟨𝑉,𝐸⟩, node 𝑥, node 𝑦

Output: the similarity of node 𝑥 and node 𝑦

The description of the algorithm:

(1) Find the common neighbor set 𝑥𝑦.common_neighbor of the node pair.

(2) Extract the sub-graph which contains the tested node pair and their common neighbors.

(3) While (the common neighbor ser is not null){

(4)  Calculate the degree of node 𝑣, and get 𝑣.degree. Node 𝑣 is one node of the

    common neighbor set.

(5)  Calculate the degree of node 𝑣 in the sub-graph extracted in the Step 2, get

     𝑣.common_degree.

(6)  Calculate the guidance capability of node 𝑣, Guidance (𝑣)=𝑣.common_degree/log(𝑣.degree)

(7)  The similarity of node 𝑥 and node 𝑦 is Similarity.𝑥𝑦+ = Guidance (𝑣)}