dc.contributor.author
Casas-Roma, Jordi
dc.contributor.author
Torra Reventós, Vicenç
dc.contributor.author
Herrera Joancomartí, Jordi
dc.date
2013-09-26T14:51:34Z
dc.date
2013-09-26T14:51:34Z
dc.identifier.citation
978-3-642-34619-4
dc.identifier.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.
dc.identifier.uri
http://hdl.handle.net/10609/24881
dc.description.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.
dc.publisher
Springer-Verlag
dc.rights
https://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject
Social networks
dc.title
Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization
dc.type
info:eu-repo/semantics/article
