2015
DOI: 10.2139/ssrn.2682561
|View full text |Cite
|
Sign up to set email alerts
|

A Survey of Link Recommendation for Social Networks: Methods, Theoretical Foundations, and Future Research Directions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
34
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(34 citation statements)
references
References 82 publications
(153 reference statements)
0
34
0
Order By: Relevance
“…To have a base line, we started from the most commonly used measures of similarity [13] which were introduced in the previous section, cosine (1) similarity, common neighbors (2), Jaccard (3) similarity and Adamic-Adar (4).…”
Section: Evaluation Of Existing Methodsmentioning
confidence: 99%
“…To have a base line, we started from the most commonly used measures of similarity [13] which were introduced in the previous section, cosine (1) similarity, common neighbors (2), Jaccard (3) similarity and Adamic-Adar (4).…”
Section: Evaluation Of Existing Methodsmentioning
confidence: 99%
“…Behind this power, we find a great importance related to the development of link recommendation features and handling the social graph basing on the topology of existing links and leveraging quantities such as node degree and edge density [13].…”
Section: Social Network Recommendationmentioning
confidence: 99%
“…At the high level, methodologies dealing with friend recommendation can be grouped into three categories [22]: classi cation, ing and ranking. e classi cation methods are based on extracted features, e.g., features between two nodes like path-based metric Katz [14] or neighbor-based metric Adamic/Adar [23].…”
Section: Related Workmentioning
confidence: 99%
“…From the algorithmic perspective, existing methodologies for the friend recommendation problem roughly fall into three categories: classi cation, ing, and ranking [10,22]. e classi cation method treats friendship between users as a binary classi cation problem, and trains a classi er to predict the likelihood of a friendship to be created between users based on pre-de ned features.…”
Section: Introductionmentioning
confidence: 99%