Research Article
Keywords-Driven and Popularity-Aware Paper Recommendation Based on Undirected Paper Citation Graph
Algorithm 3
Steiner trees algorithm: MGST (
, K).
| Input: K = | | Output: Q1and T(Q) | | (1) | Let Q1 = Ф | | (2) | For each do | | (3) | If contains any nonempty keyword set | | (4) | enqueue (, ) into Q1 | | (5) | End If | | (6) | End for | | (7) | Min_cou = ∞//the number of nodes | | (8) | While Q1 ≠ Ф do | | (9) | dequeue Q1 to (,) | | (10) | If = K | | (11) | If < Min_cou | | (12) | Min_cou = | | (13) | End If | | (14) | Break | | (15) | End If | | (16) | Else tree growth | | (17) | Else tree merging | | (18) | Return Q1 | | (19) | Return T(Q) | | (20) | End While |
|
