A practical approximation algorithm for optimal k-anonymity

Data Mining and Knowledge Discovery

Volumn 25, Issue 1, 2012, Pages 134-168

  Kenig, Batya ^a   Tassa, Tamir ^a  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Diversity; Approximation algorithms for NP hard problems; Frequent generalized itemsets; k Anonymity; Privacy preserving data mining

Indexed keywords

ANONYMIZATION; DATA BASE THEORY; DATABASE TABLES; INFORMATION LOSS; ITEM SETS; K-ANONYMITY; K-ANONYMIZATION; NP-HARD; PRIVACY PRESERVING; PRIVACY PRESERVING DATA MINING; PRIVATE INFORMATION;

COMPUTATIONAL COMPLEXITY; DATA MINING; DATA PRIVACY; HEURISTIC ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84859557518     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-011-0235-9     Document Type: Conference Paper

References (28)

1. Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Anonymizing tables. In: ICDT, pp 246-258
2. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proc. 20th int. conf. very large data bases, VLDB, pp 487-499
3. Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: ACM-SIGMOD conference on management of data, pp 439-450
4. Bayardo R, Agrawal R (2005) Data privacy through optimal k-anonymization. In: International conference on data engineering (ICDE), pp 217-228 (Pubitemid 41731133)
5. Byun J-W, Kamra A, Bertino E, Li N (2007) Efficient k-anonymization using clustering techniques. In: DASFAA, pp 188-200
6. Ghinita G, Karras P, Kalnis P, Mamoulis N (2009) A framework for efficient data anonymization under privacy and accuracy constraints. ACM Trans Database Syst 34(2)
7. A Gionis T Tassa 2009 k-anonymization with minimal loss of information IEEE Trans Knowl Data Eng 21 2 206 219 10.1109/TKDE.2008.129
8. Gionis A, Mazza A, Tassa T (2008) k-anonymization revisited. In: International conference on data engineering (ICDE), pp 744-753
9. J Goldberger T Tassa 2010 Efficient anonymizations with enhanced utility TDP 3 149 175 2725423
10. G Grahne J Zhu 2005 Fast algorithms for frequent itemset mining using fp-trees IEEE Trans Knowl Data Eng 17 10 1347 1362 10.1109/TKDE.2005.166 (Pubitemid 41560422)
11. C-J Hsiao 2005 Efficient algorithms for mining closed itemsets and their lattice structure IEEE Trans Knowl Data Eng 17 4 462 478 10.1109/TKDE.2005.60 (Pubitemid 40495590)
12. Iyengar V (2002) Transforming data to satisfy privacy constraints. In: KDD '02: proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, pp 279-288
13. LeFevre K, DeWitt D, Ramakrishnan R (2005) Incognito: efficient full-domain k-anonymity. In: ACM-SIGMOD conference on management of data, pp 49-60 (Pubitemid 43038916)
14. LeFevre K, DeWitt DJ, Ramakrishnan R (2006) Mondrian multidimensional k-anonymity. In: ICDE, p 25 (Pubitemid 44539817)
15. Li N, Li T, Venkatasubramanian S (2007) t-closeness: privacy beyond k-anonymity and ℓ-diversity. In: Proceedings of IEEE international conference on data engineering (ICDE) 2007, pp 106-115 (Pubitemid 47422014)
16. A Machanavajjhala D Kifer J Gehrke M Venkitasubramaniam 2007 ℓ-diversity: privacy beyond k-anonymity ACM Trans Knowl Discov Data 1 1 3 10.1145/1217299.1217302 (Pubitemid 46712370)
17. Meyerson A, Williams R (2004) On the complexity of optimal k-anonymity. In: PODS '04: proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, pp 223-228
18. M Nergiz C Clifton 2007 Thoughts on k-anonymization Data Knowl Eng 63 3 622 645 10.1016/j.datak.2007.03.009 (Pubitemid 47418332)
19. Park H, Shim K (2007) Approximate algorithms for k-anonymity. In: SIGMOD '07: proceedings of the 2007 ACM SIGMOD international conference on management of data, pp 67-78 (Pubitemid 47630797)
20. Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Workshop on research issues in data mining and knowledge discovery, DMKD, pp 21-30
21. P Samarati 2001 Protecting respondents' identities in microdata release IEEE Trans Knowl Data Eng 13 6 1010 1027 10.1109/69.971193 (Pubitemid 34035590)
22. Samarati P, Sweeney L (1998) Generalizing data to provide anonymity when disclosing information (abstract). In: PODS '98: proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, p 188
23. Srikant R, Agrawal R (1995) Minning generalized association rules. In: VLDB, pp 407-419
24. Sweeney L (2000) Uniqueness of simple demographics in the U.S. population. Laboratory for international Data Privacy LIDAP-WP4
25. L Sweeney 2002 k-anonymity: a model for protecting privacy Int J Uncertain Fuzz Knowl Based Syst 10 5 557 570 1948199 1085.68589 10.1142/S0218488502001648 (Pubitemid 35384857)
26. Truta T, Campan A, Meyer P (2007) Generating microdata with p-sensitive k-anonymity property. In: SDM, pp 124-141
27. Wong R, Li J, Fu A, Wang K (2006) (α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing. In: In ACM SIGKDD, pp 754-759 (Pubitemid 44535586)
28. Xiao X, Tao Y (2006) Anatomy: simple and effective privacy preservation. In: VLDB, pp 139-150