RL-KDA: A K-degree Anonymity Algorithm Based on Reinforcement Learning

K-degree anonymity is one of the main techniques for data privacy and has gained attention in academia, industry, and government. Many social network data publishing algorithms based on K-anonymity techniques have been proposed, but most studies focus on static social networks. Compared to static social networks, dynamic social networks suffer from problems such as higher information loss and lower data utility. To address the existing problem of dynamic social networks, we propose a K-degree anonymity dynamic data publishing algorithm based on reinforcement learning. The algorithm ends with two phases: anonymization sequence and graph modification. In the anonymous sequence phase, this paper combines the idea of reinforcement learning and the characteristics of dynamic data change to build a reinforcement learning model for anonymous sequences. In this way, an ideal anonymous sequence can be created. We also propose a new strategy for graph modification, which selects edges according to degree centrality to generate anonymous graphs. Finally, experiments on real datasets show the effectiveness of our algorithm.