Aug 3, 2021 · In this paper, we study the problem of ensuring k-anonymity in time-varying graphs, i.e., graphs with a structure that changes over time, and ...
(1) the temporal degree sequence of each node is anonymized, (2) the resulting degree sequences are checked to ensure that each temporal slice of the anonymized ...
This paper finds the optimal partitioning of the graph nodes such that the cost of anonymizing the degree information within each group is minimum, ...
On the k-Anonymization of Time-Varying and Multi-Layer Social ...
www.researchgate.net › ... › Graphs
In this paper, we study the problem of ensuring k-anonymity in time-varying graphs, i.e., graphs with a structure that changes over time, and multi-layer graphs ...
On the k-anonymization of time-varying and multi-layer social ...
research.aston.ac.uk › publications
On the k-anonymization of time-varying and multi-layer social graphs. Luca Rossi, Mirco Musolesi, Andrea Torsello. College of Engineering and Physical ...
Jul 1, 2019 · Therefore, some methods should be proposed to anonymize the rich-interaction, multi-layer, and time-varying graphs (Casas-Roma et al., 2017a).
On the k-Anonymization of Time-varying and Multi-layer Social Graphs. L. Rossi, M. Musolesi, and A. Torsello. In Proceedings of the 9th International AAAI ...
Rossi et al. (2015a), on the other hand, extended the concept of k-degree anonymity to multi-layer and time-varying graphs. Other researchers considered ...
Musolesi, and A. Torsello, On the k-anonymization of time-varying and multi-layer social graphs, arXiv preprint arXiv: 1503.06497, 2015.
Abstract In this paper, we consider the problem of anonymization on directed networks. Although there are several anonymization methods for networks, most.