2017
DOI: 10.1007/s10791-017-9300-3
|View full text |Cite
|
Sign up to set email alerts
|

Collaborator recommendation in heterogeneous bibliographic networks using random walks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 36 publications
(13 citation statements)
references
References 34 publications
0
13
0
Order By: Relevance
“…ere exist some works that stand on the shoulder of random walk for academic collaborator recommendation, which had been proved to be competent for calculating the rank score of researchers in the academic collaborator network [33]. ese methods completely utilized the weight on edge to guide Random Walker on the academic collaborator network [24,34,35]. ese values of weight were composed of the affiliated institution of the researcher or the academic factors, such as coauthor order, latest collaboration time, and the times of collaboration.…”
Section: Related Workmentioning
confidence: 99%
“…ere exist some works that stand on the shoulder of random walk for academic collaborator recommendation, which had been proved to be competent for calculating the rank score of researchers in the academic collaborator network [33]. ese methods completely utilized the weight on edge to guide Random Walker on the academic collaborator network [24,34,35]. ese values of weight were composed of the affiliated institution of the researcher or the academic factors, such as coauthor order, latest collaboration time, and the times of collaboration.…”
Section: Related Workmentioning
confidence: 99%
“…erefore, various studies [8-10, 12, 20-24] attempted to extract structural features of the bibliographic networks and to apply to predicting future coauthorship. To deal with the structural features, affinity propagation based on random walks was the most popular [9,10,20,25]. However, recently, network embedding models enable us to represent the structural features by using low-dimensional fixed-length vectors [1,5,6,12,26].…”
Section: Related Workmentioning
confidence: 99%
“…In a heterogeneous network, Zhou Ding, Li, and Wan (2017) introduces an algorithm named Random Walk with Restart-based Collaborator Recommendation (RWR-CR) to solve the collaborator recommendation problem. This method includes three steps: 1) heterogeneous bibliographic network construction; 2) edge weighting; and 3) random walk with the restart.…”
Section: Related Workmentioning
confidence: 99%