Link Prediction Algorithm |
Input: matrix N with n*n dimensions, represent the investigating network |
Output: best N(i, j) link to be established |
1. imax = 1, jmax = 2 |
2. Max = 0 |
3. for i = 1 to n |
4. for j = i + 1 to n |
5. if N[i, j] = 0 |
6. Rank = score (i, j) |
7. if Rank > Max |
8. Max = score (i, j) |
9. imax = i, jmax = j |
10. return i, j, Score (i, j) |