Dynamic Node Privacy Feature Decoupling Graph Autoencoder Based on Attention Mechanism

Graph autoencoders’ inherent capability to capture node feature correlations poses significant privacy risks through attackers inference. Previous feature decoupling approaches predominantly apply uniform privacy protection across nodes, disregarding the varying sensitivity levels inherent in graph structures. To solve the above problems, we propose a novel dual-path graph autoencoder incorporating attention-aware privacy adaptation. Firstly, we design an attention-driven metric learning framework to quantify node-specific privacy importance through attention weights and select important nodes to construct the privacy distribution, so that realizing the dynamically privacy decoupling and reducing utility loss. Then, we introduce Hilbert-Schmidt Independence Criterion (HSIC) to measure the dependence between privacy and non-privacy information, which avoids the deviations that occur when using approximate methods such as variational inference. Finally, we use the method of alternating training to comprehensively evaluate the privacy importance of nodes. Experimental results on three real-world datasets—Yale, Rochester, and Credit Defaulter—demonstrate that our proposed method significantly outperforms existing approaches like PVGAE, GAE-MI, and APGE, where the inference accuracy regarding privacy decreased by 25.5%, but the accuracy rate of link prediction achieved the highest 84.7% compared to other methods.