On some clustering approaches for graphs
2011 (English)In: Fuzzy Systems (FUZZ), 2011, IEEE , 2011, 409-415 p.Conference paper (Refereed)
In this paper we discuss some tools for graph perturbation with applications to data privacy. We present and analyse two different approaches. One is based on matrix decomposition and the other on graph partitioning. We discuss these methods and show that they belong to two traditions in data protection: noise addition/microaggregation and k-anonymity.
Place, publisher, year, edition, pages
IEEE , 2011. 409-415 p.
, IEEE International Conference on Fuzzy Systems. Proceedings, ISSN 1098-7584
Data privacy, clustering, graph, k-anonymity, microaggregation
Information Systems Computer Science Discrete Mathematics
IdentifiersURN: urn:nbn:se:liu:diva-91478DOI: 10.1109/FUZZY.2011.6007447ISBN: 978-1-4244-7315-1ISBN: e-978-1-4244-7316-8OAI: oai:DiVA.org:liu-91478DiVA: diva2:618062
IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2011), 27-30 June 2011, Taipei, Taiwan