Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/133264
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | An Algorithm For $k$-Degree Anonymity On Large Networks |
Autor: | Casas, Jordi; Herrera, Jordi; Torra, Vicenç CSIC ORCID | Palabras clave: | Data privacy Network theory K-degree anonymity Social networking Graph theory |
Fecha de publicación: | 25-ago-2013 | Editor: | Institute of Electrical and Electronics Engineers | Citación: | ASONAM '13 Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 671-675 | Resumen: | In this paper, we consider the problem of anonymization on large networks. There are some anonymization methods for networks, but most of them can not be applied on large networks because of their complexity. We present an algorithm for k-degree anonymity on large networks. Given a network G, we construct a k-degree anonymous network, G, by the minimum number of edge modifications. We devise a simple and efficient algorithm for solving this problem on large networks. Our algorithm uses univariate micro-aggregation to anonymize the degree sequence, and then it modifies the graph structure to meet the k-degree anonymous sequence. We apply our algorithm to a different large real datasets and demonstrate their efficiency and practical utility. | URI: | http://hdl.handle.net/10261/133264 | DOI: | 10.1145/2492517.2492643 | Identificadores: | doi: 10.1145/2492517.2492643 isbn: 978-1-4503-2240-9 |
Aparece en las colecciones: | (IIIA) Comunicaciones congresos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
accesoRestringido.pdf | 15,38 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
162
checked on 03-may-2024
Download(s)
155
checked on 03-may-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.