Betweenness Centrality Based k-Anonymity for Privacy Preserving in Social Networks
Author(s)
Tian, Hui
Lu, Yue
Liu, Jingtian
Yu, Jingjing
Griffith University Author(s)
Year published
2018
Metadata
Show full item recordAbstract
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 ...
View more >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.
View less >
View more >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.
View less >
Conference Title
Proceedings of the 16th International Conference on Advances in Mobile Computing and Multimedia - MoMM2018
Volume
2018-Nov
Subject
Distributed computing and systems software