2020
DOI: 10.1109/access.2020.3044367
|View full text |Cite
|
Sign up to set email alerts
|

The Network Representation Learning Algorithm Based on Semi-Supervised Random Walk

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…By calculating the similarity between different targets, the predicted score is calculated [ 37 ]. Compared with the calculating similarity by relying on neighbouring nodes, RWR can capture the global structural information of the network more comprehensively [ 38 , 39 ]. Starting from a certain node in the target set, RWR selects adjacent nodes with probability c (0 < c < 1) at random, or return to the previous node with probability (1− c ).…”
Section: Resultsmentioning
confidence: 99%
“…By calculating the similarity between different targets, the predicted score is calculated [ 37 ]. Compared with the calculating similarity by relying on neighbouring nodes, RWR can capture the global structural information of the network more comprehensively [ 38 , 39 ]. Starting from a certain node in the target set, RWR selects adjacent nodes with probability c (0 < c < 1) at random, or return to the previous node with probability (1− c ).…”
Section: Resultsmentioning
confidence: 99%