Research Article
Immune Algorithm to Suppress Rumor Propagation Based on Influence Maximization
Require:, k1; | Ensure:; | (1) | Initialize , , | (2) | R = Detect S in RNN rumor detection model | (3) | for u in R do | (4) | Perform BFS from u in G and insert visited nodes into R_adj | (5) | for u in R_adj do | (6) | Delete u if the outDegree = = 0 or neighbors R | (7) | for u in R do | (8) | Perform DFS from u in the network diagram G and insert visited nodes into T | (9) | Gʹ = Apply Acyclic on T to generate a DAG and a topological ordering | (10) | for u in R do | (11) | Perform DFS from u in G′ and insert visited nodes into Cand_S | (12) | for u in R do | (13) | Calculate by equation (5), then calculate by equation (6) | (14) | Imm_S = Find the top k1 nodes with the maximum UIm value and insert in the set | (15) | return Imm_S |
|