Research Article
Keywords-Driven and Popularity-Aware Paper Recommendation Based on Undirected Paper Citation Graph
Input: K = | Output: Q1 | (1) | For each u ∈ do | (2) | If | (3) | | (4) | enqueue into Q1 | (5) | update Q1 | (6) | End If | (7) | Return Q1 | (8) | End For | (9) | | (10) | For each is contained in K s.t do | (11) | If < | (12) | | (13) | enqueue into Q1 | (14) | update Q1 | (15) | End If | (16) | Return Q1 | (17) | End For |
|