Consider the undirected graph (Figure 5.19) with 7 nodes (A, B, C, D, E, F and G) with the following edges: A → B, D B → C, E, G C → D, E D → F E → G Figure 5.19 Using the Common Neighbors and the...

Consider the undirected graph (Figure 5.19) with 7 nodes (A, B, C, D, E, F and G) with the following edges:

A → B, D

B → C, E, G

C → D, E

D → F

E → G

Figure 5.19

Using the Common Neighbors and the Jaccard’s Coefficient methods, provide the ranked list in decreasing order of scores calculated by each proximity measure. Remember, the score values provided by the proximity measures are used to predict future links.