Research Article
A Movie Recommendation System Based on Differential Privacy Protection
Algorithm 1
Privacy budget allocation algorithm.
| | Input: Privacy budget s, prefix tree DP-Tree, root node R | | | Output: Privacy budget allocation results set TMovie | | (1) | Initialize set TMovie and TQueue to 0 | | (2) | If (R = = ’ ’) | | (3) | = 0 | | (4) | Rchild(R) | | (5) | Else | | (6) | Add the current node <R,> to TQueue | | (7) | While TQueue ≠ NULL Do | | (8) | GetTop(TQueue,R ) | | (9) | IF R TMovie Then | | (10) | ⟵ privacy budget for node R in TMovie | | (11) | TMovie ← <R,> | | (12) | Else | | (13) | TMovie ← <R,> | | (14) | End If | | (15) | If () | | (16) | ε←ε/2 | | (17) | Else | | (18) | ε←()/2 | | (19) | For (child node of the current node) | | (20) | ← frequency of watching movies with tag v | | (21) | Append <, > to TQueue | | (22) | End For | | (23) | End while |
|
