Please use this identifier to cite or link to this item:

http://hdl.handle.net/10609/24881
Title: Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization
Author: Casas Roma, Jordi
Torra Reventós, Vicenç
Herrera Joancomartí, Jordi
Keywords: Social networks
k-Anonymity
Privacy
Anonimization
Issue Date: 1-Nov-2012
Publisher: Springer-Verlag
Citation: 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.
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.
Language: English
URI: http://hdl.handle.net/10609/24881
Other Identifiers: 978-3-642-34619-4
Appears in Collections:Research papers

Share:
Export:
Files in This Item:
File Description SizeFormat 
Casas-Roma, Herrera-Joancomartí, Torra - 2012 - Comparing Random-based and k-Anonymity-based Algorithms for Graph.pdfArticle MDAI 2012254.82 kBAdobe PDFView/Open

Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.