Research Article
Key Node Discovery Algorithm Based on Multiple Relationships and Multiple Features in Social Networks
Algorithm 3
Key node discovery algorithm.
| | Input:, : which obtained from Algorithm 1 | | | Output: top-K nodes: | | (1) | , , , | | (2) | for each graph do | | (3) | for each edge do | | (4) | by formula (10) | | (5) | end for | | (6) | end for | | (7) | Obtain the multirelationship network by Algorithm 2 | | (8) | Compute by formula (6) | | (9) | Compute by formula (7) | | (10) | Compute by formula (8) | | (11) | Compute by formula (9) | | (12) | fordo | | (13) | Compute by formula (11) | | (14) | end for | | (15) | Sort () | | (16) | Return top-K nodes |
|
