Scalable non-deterministic clustering-based k-anonymization for rich networks
Sign Up to like & getrecommendations! Published in 2018 at "International Journal of Information Security"
DOI: 10.1007/s10207-018-0409-1
Abstract: In this paper, we tackle the problem of graph anonymization in the context of privacy-preserving social network mining. We present a greedy and non-deterministic algorithm to achieve k-anonymity on labeled and undirected networks. Our work… read more here.
Keywords: scalable non; clustering based; anonymization; based anonymization ... See more keywords