DUEF-GA: data utility and privacy evaluation framework for graph anonymization
Anonymization of graph-based data is a problem which has been widely studied over the last years, and several anonymization methods have been developed. Information loss measures have been used to evaluate data utility and information loss in the anonymized graphs. However, there is no consensus abo...
| Author: | |
|---|---|
| Format: | article |
| Status: | Versión aceptada para publicación |
| Publication Date: | 2020 |
| Country: | España |
| Institution: | Universitat Oberta de Catalunya (UOC) |
| Repository: | O2, repositorio institucional de la UOC |
| OAI Identifier: | oai:openaccess.uoc.edu:10609/152520 |
| Online Access: | http://hdl.handle.net/10609/152520 https://doi.org/10.1007/s10207-019-00469-4 |
| Access Level: | Open access |
| Keyword: | privacy-preserving anonymity evaluation framework data utility social networks graphs |
| Summary: | Anonymization of graph-based data is a problem which has been widely studied over the last years, and several anonymization methods have been developed. Information loss measures have been used to evaluate data utility and information loss in the anonymized graphs. However, there is no consensus about how to evaluate data utility and information loss in privacy-preserving and anonymization scenarios, where the anonymous datasets were perturbed to hinder re-identification processes. Authors use diverse metrics to evaluate data utility and, consequently, it is complex to compare different methods or algorithms in the literature. In this paper, we propose a framework to evaluate and compare anonymous datasets in a common way, providing an objective score to clearly compare methods and algorithms. Our framework includes metrics based on generic information loss measures, such as average distance or betweenness centrality and also task-specific information loss measures, such as community detection or information flow. Additionally, we provide some metrics to examine re-identification and risk assessment. We demonstrate that our framework could help researchers and practitioners to select the best parametrization and/or algorithm to reduce information loss and maximize data utility. |
|---|