2020
DOI: 10.1016/j.physa.2020.124980
|View full text |Cite
|
Sign up to set email alerts
|

Link prediction using node information on local paths

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 43 publications
(14 citation statements)
references
References 33 publications
0
12
0
Order By: Relevance
“… Moradabadi and Meybodi (2018) proposed a strategy of learning automata for link prediction in weighted social networks. Aziz et al (2020) proposed a novel link prediction method that aims at improving the accuracy of existing path-based methods by incorporating information about the nodes along local paths. Tang R. et al (2021) proposed a framework based on multiple types of consistency between embedding vectors (MulCEVs).…”
Section: Related Workmentioning
confidence: 99%
“… Moradabadi and Meybodi (2018) proposed a strategy of learning automata for link prediction in weighted social networks. Aziz et al (2020) proposed a novel link prediction method that aims at improving the accuracy of existing path-based methods by incorporating information about the nodes along local paths. Tang R. et al (2021) proposed a framework based on multiple types of consistency between embedding vectors (MulCEVs).…”
Section: Related Workmentioning
confidence: 99%
“…Recently, with the rapid development of network embedding technology, various embedding models have emerged. These methods learn the low-dimensional representation of nodes in large-scale networks, which performs well in link prediction (Aziz et al, 2020;Cen et al, 2019), node classification (Dong, Chawla, & Swami, 2017), and community detection (Chen et al, 2020).…”
Section: Introductionmentioning
confidence: 99%
“…Local similarity methods explore local information of the disconnected nodes such as common neighbors and node degree, and include Common Neighbors (CNs) [ 8 ], Jaccard coefficient (JC) [ 9 ], Preferential Attachment (PA) [ 10 ], the Adamic–Adar (AA) index [ 11 ], Resource Allocation (RA) [ 12 ], Cosine similarity, and the Salton index (SI) [ 13 ]. These methods achieve good results in many cases due to lower computational complexity and simple implementation [ 14 ]. Global similarity methods utilize the topological information of the whole network for link prediction.…”
Section: Introductionmentioning
confidence: 99%