Empreu aquest identificador per citar o enllaçar aquest ítem:
http://hdl.handle.net/10609/24881
Títol: | Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization |
Autoria: | Casas-Roma, Jordi Torra, Vicenç Herrera-Joancomartí, Jordi |
Citació: | Casas, J.;Herrera, J.;Torra, V.. (2012). "Proceedings in The 9th International Conference on Modeling Decisions for Artificial Intelligence. Lecture Notes in Computer Science.". A:Torra, V.;Narukawa, Y.;López, B.;Villaret, M..Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization.GIRONA.Springer-Verlag. Pág. 197 - 209. ISBN: 978-3-642-34619-4. |
Resum: | 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. |
Paraules clau: | Social networks k-Anonymity Privacy Anonimization |
Tipus de document: | info:eu-repo/semantics/article |
Data de publicació: | 1-nov-2012 |
Llicència de publicació: | https://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
Apareix a les col·leccions: | Articles cientÍfics Treballs, papers de recerca |
Arxius per aquest ítem:
Arxiu | Descripció | Mida | Format | |
---|---|---|---|---|
Casas-Roma, Herrera-Joancomartí, Torra - 2012 - Comparing Random-based and k-Anonymity-based Algorithms for Graph.pdf | Article MDAI 2012 | 254,82 kB | Adobe PDF | Veure/Obrir |
Comparteix:
Els ítems del Repositori es troben protegits per copyright, amb tots els drets reservats, sempre i quan no s’indiqui el contrari.