The Adamic–Adar index is a measure introduced in 2003 by Lada Adamic and 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 where is the set of nodes adjacent to . 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.
Attributes | Values |
---|
rdfs:label
| - Adamic–Adar index (en)
- Coefficiente Adamic/Adar (it)
|
rdfs:comment
| - The Adamic–Adar index is a measure introduced in 2003 by Lada Adamic and 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 where is the set of nodes adjacent to . 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. (en)
- Il coefficiente Adamic/Adar è una formula proposta da Lada Adamic e per la predizione di collegamenti in una rete sociale, basata sulla quantità di elementi in comune tra due utenti. È definito come la somma della frequenza logaritmica inversa degli elementi in comune, ovvero in un generico grafo come l'inverso del logaritmo del grado di centralità dei vicini comuni tra due nodi (it)
|
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
has abstract
| - The Adamic–Adar index is a measure introduced in 2003 by Lada Adamic and 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 where is the set of nodes adjacent to . 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. (en)
- Il coefficiente Adamic/Adar è una formula proposta da Lada Adamic e per la predizione di collegamenti in una rete sociale, basata sulla quantità di elementi in comune tra due utenti. È definito come la somma della frequenza logaritmica inversa degli elementi in comune, ovvero in un generico grafo come l'inverso del logaritmo del grado di centralità dei vicini comuni tra due nodi dove indica l'insieme dei nodi adiacenti a . Tale definizione sfrutta il fatto che elementi comuni di grande diffusione hanno minor significato nella predizione di un collegamento rispetto ad elementi condivisi da un numero limitato di utenti. (it)
|
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage redirect
of | |
is foaf:primaryTopic
of | |