Link Prediction: Comprehensive Choice Strategy For the graph given below: (i) Identify the top 3-ranked node pairs that could be connected with a link under each of the following link prediction strategies: (a) Preferential Attachment (b) Adamic Adar Coefficient (c) Jaccard Coefficient (ii) Use the rankings determined in (i) to come up with a comprehensive score for each of the node pairs that are in the top-3 rankings for at least one of the three strategies, and identify the node pair(s) that ha(s/ve) the largest comprehensive score to be connected with a link. Show all the work in detail. You should NOT use the .jar files to determine the link prediction scores.

 

6 4 3 2 0 (7) 5 (1)