Local and global recoding methods for anonymizing set-valued data

VLDB Journal

Volumn 20, Issue 1, 2011, Pages 83-106

  Terrovitis, Manolis ^a   Mamoulis, Nikos ^b   Kalnis, Panos ^c  

^a INSTITUTE FOR THE MANAGEMENT OF INFORMATION SYSTEMS   (Greece)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c KING ABDULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Saudi Arabia)

Author keywords

Anonymity; Database privacy; Set valued data

Indexed keywords

DATABASE SYSTEMS; OPTIMIZATION;

ANONYMITY; DATA DIMENSIONALITY; EXPERIMENTAL EVALUATION; GREEDY HEURISTICS; MEMORY CONSUMPTION; PERSONAL CHARACTERISTICS; SET-VALUED DATUM; VERTICAL PARTITIONING;

DATA PRIVACY;

EID: 78751575731     PISSN: 10668888     EISSN: 0949877X     Source Type: Journal    
DOI: 10.1007/s00778-010-0192-8     Document Type: Article

References (32)

1. Aggarwal, C.C.: On k-anonymity and the curse of dimensionality.In: VLDB'05: Proceedings of the 31st International Conference onVery Large Data Bases, pp. 901-909. VLDB Endowment (2005)
2. Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., Zhu, A.: Achieving anonymity via clustering. In: Proceedingsof ACM PODS, pp. 153-162 (2006)
3. Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Approximation algorithms fork-anonymity. J. Priv. Tech. (Paper number: 20051120001) (2005)
4. Atzori, M., Bonchi, F., Giannotti, F., Pedreschi, D.: Anonymitypreserving pattern discovery. VLDB J. (accepted for publication) (2008)
5. Bayardo, R.J., Agrawal, R.: Data privacy through optimalk-anonymization. In: Proceedings of ICDE, pp 217-228 (2005)
6. Dean, J., Ghemawat, S.: Mapreduce: simplified data processing onlarge clusters. pp. 137-150. December (2004)
7. Ghinita, G., Karras, P., Kalnis, P., Mamoulis, N.: Fast data anonymizationwith low information loss. In: vldb, pp. 758-769 (2007)
8. Ghinita, G., Tao, Y., Kalnis, P.: On the anonymization of sparsehigh-dimensional data. In: Proceedings of ICDE, (2008)
9. Han, J., Fu, Y.: Discovery of multiple-level association rules fromlarge databases. In: vldb, pp. 420-431 (1995)
10. Han, J., Fu, Y.: Mining multiple-level association rules in largedatabases. IEEE TKDE 11(5), 798-805 (1999)
11. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidategeneration. In: Proceedings of ACM SIGMOD, pp. 1-12 (2000)
12. He, Y., Naughton, J.F.: Anonymization of set-valued data via topdown,local generalization. PVLDB 2(1), 934-945 (2009)
13. Iyengar, V.S.: Transforming data to satisfy privacy constraints.In: Proceedings of SIGKDD, pp. 279-288 (2002)
14. LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: efficientfull-domain k-anonymity. In: Proceedings ofACMSIGMOD, pp. 49-60 (2005)
15. LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Mondrian multidimensionalk-anonymity. In: Proceedings of ICDE (2006)
16. Li, N., Li, T., Venkatasubramanian, S.: t-Closeness: privacy beyondk-anonymity and l-diversity. In: Proceedings of ICDE, pp. 106-115 (2007)
17. Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-Diversity: privacy beyond k-anonymity. In: Proceedings ofICDE (2006)
18. Meyerson, A., Williams, R.: On the complexity of optimalK-anonymity. In: Proceedings of ACMPODS, pp. 223-228 (2004)
19. Nergiz, M., Clifton, C., Nergiz, A.: Multirelational k-anonymity. Technical Report CSD TR 08-002
20. Nergiz, M., Clifton, C., Nergiz, A.: Multirelational k-anonymity.In: Proceedings of ICDE, pp. 1417-1421 (2007)
21. Nergiz, M.E., Clifton, C.: Thoughts on k-anonymization. Data.Knowl. Eng. 63(3), 622-645 (2007)
22. Park, H., Shim, K.: Approximate algorithms for k-anonymity.In: Proceedings of ACM SIGMOD, pp. 67-78 (2007)
23. Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical recipes in C, 2nd edn. Cambridge University Press,Cambridge (1992)
24. Samarati, P.: Protecting respondents' identities in microdatarelease. IEEE TKDE 13(6), 1010-1027 (2001)
25. Sweeney, L.: k-Anonymity: a model for protecting privacy.Int. J. Uncertain. Fuzziness Knowl. Based Syst. 10(5), 557-570 (2002)
26. Terrovitis, M., Mamoulis, N., Kalnis, P.: Privacy-preserving anonymizationof set-valued data. In: Proceedings of theVLDB Endowment(PVLDB) (former VLDB proceedings) 1(1) (2008)
27. Verykios, V.S., Elmagarmid, A.K., Bertino, E., Saygin, Y., Dasseni, E.: Association rule hiding. IEEE TKDE 16(4), 434-447 (2004)
28. Xiao, X., Tao, Y.: Anatomy: simple and effective privacy preservation.In: Proceedings of VLDB, pp. 139-150 (2006)
29. Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., Fu, A.: Utility-basedanonymization using local recoding. In: Proceedings of SIGKDD, pp. 785-790 (2006)
30. Xu, Y., Wang, K., Fu, A.W.-C., Yu, P.S.: Anonymizing transactiondatabases for publication. In: Proceedings of KDD, pp. 767-775 (2008)
31. Zhang, Q., Koudas, N., Srivastava, D., Yu, T.: Aggregate queryanswering on anonymized tables. In: Proceedings of ICDE, pp. 116-125 (2007)
32. Zheng, Z., Kohavi, R., Mason, L.: Real world performance ofassociation rule algorithms. In: Proceedings of KDD, pp. 401-406 (2001)