Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/10609/24881
Títol:
|
Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization
|
Autor/a:
|
Casas Roma, Jordi; Torra Reventós, Vicenç; Herrera Joancomartí, Jordi
|
Abstract:
|
Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-
ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in order
to obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs. |
Matèries:
|
-Social networks -k-Anonymity -Privacy -Anonimization |
Drets:
|
https://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
Tipus de document:
|
Article |
Publicat per:
|
Springer-Verlag
|
Compartir:
|
|
Mostra el registre complet del document