Betweenness Centrality Based K-Anonymity For Privacy Preserving In Social Networks

In order to reduce information loss rate of the k-anonymous network, we propose an anonymous network reconstruction algorithm based on nodes' betweenness centrality. Betweenness centrality measures the nodes' significance in graph based on the shortest paths. In our algorithm, nodes are sorted according to betweenness centrality and the candidate nodes with great value are reconnected preferentially. Then the backbone structure of the network could be retained which guarantee the important features of the reconstruct network. We evaluate our method on real data sets by different metrics. The experiment results justify the efficiency and practical utility of our proposed method.