2017
DOI: 10.1007/978-3-319-70139-4_74
|View full text |Cite
|
Sign up to set email alerts
|

Exploiting Non-visible Relationship in Link Prediction Based on Asymmetric Local Random Walk

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…Structural-based methods do not rely on the individual information of the nodes but based on the topological information of the graph [41,21]. An early attempt is credited to [1] that defines the Adamic-Adar measure between node i and node j as: (1) where Γi is the set of direct neighbors of the node i.…”
Section: Link-prediction Problemmentioning
confidence: 99%
“…Structural-based methods do not rely on the individual information of the nodes but based on the topological information of the graph [41,21]. An early attempt is credited to [1] that defines the Adamic-Adar measure between node i and node j as: (1) where Γi is the set of direct neighbors of the node i.…”
Section: Link-prediction Problemmentioning
confidence: 99%