Table 1 Some similarity measures for link prediction
From: An efficient method for link prediction in weighted multiplex networks
Name of the index | Description |
|---|---|
Adamic/Adar [14] | Counting of common features by weighting rarer features more heavily |
Preferential attachment | Product of degree of nodes |
Katz index | Ensemble of all paths with more weight to shorter paths |
Random walk with restart [15] | Steps in which a random walker reaches from one node to another |
Resource allocation [16] | Assigns scores according to resource distribution between candidate vertices with common neighbors as transmitters |