iBGP: A Bipartite Graph Propagation Approach for Mobile Advertising Fraud Detection

Algorithm 2

iBGP.

(1)   Input: bipartite graph , lower bound of scores , error bound ,

     exponent parameter , regularization parameter , maximum iteration limit

(2)  Output: ranking of

(3)  set

(4)  set the return values of Algorithm 1

(5)   while and do

(6)     for each do

(7)       compute for target node as in Eq. (11)

(8)     end for

(9)     for each do

(10)      compute for source node as in Eq. (12)

(11)      end for

(12)     

(13) end while

     return the ranking result of