Local Differential Privacy Graph Data Modeling Method for Link Prediction

To solve the problem of node sensitive link privacy being exposed in the process of link prediction on industrial business graph data , according to the theory of local differential privacy , the shortcomings of the existing graph privacy protection technology are analyzed from the perspective of...

Full description

Saved in:
Bibliographic Details
Main Authors: HANQilong, WUXiaoming
Format: Article
Language:zho
Published: Harbin University of Science and Technology Publications 2023-10-01
Series:Journal of Harbin University of Science and Technology
Subjects:
Online Access:https://hlgxb.hrbust.edu.cn/#/digest?ArticleID=2257
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:To solve the problem of node sensitive link privacy being exposed in the process of link prediction on industrial business graph data , according to the theory of local differential privacy , the shortcomings of the existing graph privacy protection technology are analyzed from the perspective of link prediction task performance. Based on the existing randomized response mechanism , it introduces the personalized sampling technology to reduce the noise addition on the user side. At the same time , combined with the subgraph partitioning strategy of two rounds of data collection , the subgraph cluster feature of the original graph is retained. Finally , a personalized sampling randomized response local differential privacy ( PSRR-LDP) graph data perturbing algorithm was implemented , and the PSRR-LDP algorithm is theoretically proved to satisfy the ε -edge Local differential privacy. The simulation experiments show that the PSRR-LDP algorithm has better link prediction performance while ensuring privacy.
ISSN:1007-2683