{'fraction_non_alphanumeric': 0.02026554856743536, 'fraction_numerical': 0.0, 'mean_word_length': 5.786729857819905, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Differentially Private Graph Clustering Algorithm Based on Structure Similarity

With the widespread use of new information systems such as social networks, recommendation systems as well as location-based services, graph data has become a very common and important data type. It has been shown that, from these collected graph data, some special substructures can be found through clustering analysis, and can further support the intelligent decision. However, directly publishing or using clustering results on these graph data would disclose the privacy information of system users. To this end, based a classical structural clustering algorithm for networks (SCAN) and the technology of differential privacy, we propose a differentially private graph clustering algorithm named DP-SCAN. Specifically, we first reasonably calibrate the global sensitivity of the function of computing structure similarity between nodes in the graph, and thus specify parameters of the Laplace mechanism for capturing differential privacy. Then, we provide details of the DP-SCAN algorithm. The theoretical analysis indicates that DPSCAN algorithm satisfies ϵ-differential privacy, without trading off the clustering efficiency. The experimental results show that, when compared with the original SCAN clustering algorithm, DP-SCAN clustering algorithm can maintain the validity of clustering under the premise of satisfying differential privacy.