Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/14600
Title: | Performance Analysis of K-Degree Anonymization on Barabási-Albert Graph |
Authors: | Soygazi, Fatih Oğuz, Damla |
Abstract: | Anonymity is one the most important problems that emerged with the increasing number of graph-based social networks. It is not straightforward to ensure anonymity by adding or removing some nodes from the graph. Therefore, a more sophisticated approach is required. The consideration of the degree of the nodes in a graph may facilitate having knowledge about specific nodes. To handle this problem, one of the prominent solutions is k-degree anonymization where some nodes involving particular degree values are anonymized by masking its information from the attackers. Our objective is to evaluate the achievement of k-degree anonymization with a well-known graph structure, namely, Barabási-Albert graph, which is similar to the graphs on social networks. Hence, we generate multiple synthetic Barabási-Albert graphs and evaluate the k-degree anonymization performance on these graphs. According to experimental results, the success of k-degree anonymity approximately proportional to the number of edges or nodes. |
URI: | https://doi.org/10.35414/akufemubid.1149701 https://search.trdizin.gov.tr/tr/yayin/detay/1216283/performance-analysis-of-k-degree-anonymization-on-barabasi-albert-graph https://hdl.handle.net/11147/14600 |
ISSN: | 2149-3367 |
Appears in Collections: | TR Dizin İndeksli Yayınlar / TR Dizin Indexed Publications Collection |
Show full item record
CORE Recommender
Sorry the service is unavailable at the moment. Please try again later.
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.