Adamic–Adar index

The Adamic–Adar index is a measure introduced in 2003 by Lada Adamic and Eytan Adar to predict links in a social network, according to the amount of shared links between two nodes. It is defined as the sum of the inverse logarithmic degree centrality of the neighbours shared by the two nodes{{cite web|url=https://sparkling-graph.readthedocs.io/en/latest/adamic.html#adamic|title=Adamic/Adar}}

$A(x,y) = \sum_{u \in N(x) \cap N(y)} \frac{1}{\log$

N(u)

}

where $N(u)$ is the set of nodes adjacent to $u$ . The definition is based on the concept that common elements with very large neighbourhoods are less significant when predicting a connection between two nodes compared with elements shared between a small number of nodes.{{harvnb|Adamic|Adar|2003|p=222}}

References

{{Cite journal|title= Friends and neighbors on the web|last1= Adamic|first1= Lada A|last2= Adar|first2= Eytan|s2cid= 2262951|journal= Social Networks|volume= 25|number= 3|pages= 211–230|year= 2003|publisher= Elsevier|doi= 10.1016/S0378-8733(03)00009-1}}
{{cite book|title=Provenance Data in Social Media|first1=Geoffrey|last1=Barbier|first2=Zhuo Feng|last2=Pritam Gundecha|publisher=Morgan & Claypool Publishers|year=2013|isbn=9781608457847}}
{{cite book|title=Social Network-Based Recommender Systems|first1=Daniel|last1=Schall|publisher=Springer|year=2015|page=12|isbn=9783319227351}}
{{cite book|title=Link Prediction in Social Networks: Role of Power Law Distribution|series=Springer Briefs in Computer Science|first1=Srinivas|last1=Virinchi|first2=Pabitra|last2=Mitra|publisher=Springer|year=2016|isbn=9783319289229|page=7}}

Category:Data mining

Category:Index numbers

Category:Similarity measures

Adamic–Adar index

References

Further reading