Research Article
A Stable-Matching-Based User Linking Method with User Preference Order
Algorithm 1
Stable User Linking with Preference order, SULP.
| Input: account set | | Output: result set | | (1) Initializes the result set | | (2) Calculate the posterior probability of any | | (3) Sort to get the preference order set for each account | | (4) if then | | (5) Add fake accounts to the small parties, and set the preference order set keeps empty | | (6) end if | | (7) while Exists any account is not linked ’s preference order set do | | (8) Find the most preferred target account from ’s preference order set and remove it | | (9) if is not linked is in the preference order of then | | (10) Set linked, | | (11) else if is linked then | | (12) Get the linking object of | | (13) if is in the preference order set of then | | (14) Cancel the linking state of , | | (15) Set linked, | | (16) end if | | (17) end if | | (18) end while | | (19) Remove all the accounts linked with | | (20) return |
|