Research Article
iBGP: A Bipartite Graph Propagation Approach for Mobile Advertising Fraud Detection
Algorithm 1
Computing the fraud scores of user nodes.
(1) Input: bipartite graph , lower bound of scores , | error bound , exponent parameter , regularization parameter | (2) Output: Scores of user nodes | (3) for each do | (4) set . | (5) end for | (6) for each do | (7) set | (8) if then | (9) while and do | (10) | (11) end while | (12) else | (13) while and do | (14) | (15) end while | (16) end if | (17) if or then | (18) | (19) else | (20) GSM () on initial points | (21) end if | (22) end for | return |
|