Approximate algorithms with generalizing attribute values for k-anonymity

Information Systems

Volumn 35, Issue 8, 2010, Pages 933-955

  Park, Hyoungmin ^a   Shim, Kyuseok ^a  

^a Seoul National University   (South Korea)

Author keywords

Anonymity; Data mining; Data publishing; Local recoding; Privacy preservation

Indexed keywords

ANONYMIZATION; APPROXIMATE ALGORITHMS; APPROXIMATION RATIOS; APPROXIMATION RESULTS; ATTRIBUTE VALUES; DATA PUBLISHING; INFORMATION LOSS; K-ANONYMITY; LOCAL RECODING; NP-HARD; PRIVACY PRESERVATION; RECODING; ROOT NODES; RUNNING TIME; SENSITIVE INFORMATIONS; SOCIAL SECURITY NUMBERS; SUPPRESSION METHOD; TRADITIONAL APPROXIMATION;

DATA MINING; DATA PRIVACY;

APPROXIMATION ALGORITHMS;

EID: 77955553620     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2010.06.002     Document Type: Article

References (18)

1. P. Samarati, and L. Sweeny Generalizing data to provide anonymity when disclosing information (abstract) Proceedings of ACM Symposium on Principles of Database Systems 1998 188
2. L. Sweeny k-anonymity: a model for protecting privacy International Journal on Uncertainty, Fuzziness and Knowledge-based Systems 10 5 2002 557 570
3. C.C. Aggarwal, On k-anonymity and the curse of dimensionality, in: VLDB, 2005, pp. 901909.
4. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu Anonymizing tables ICDT 2005 246 258
5. K. LeFevre, D.J. DeWitt, and R. Ramakrishnan Mondrian multidimensional k-anonymity ICDE 2006 25
6. A. Meyerson, and R. Williams On the complexity of optimal k-anonymity Proceedings of PODS 2004
7. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu Approximation algorithms for k-anonymity Journal of Privacy Technology 2005
8. R. Bayardo, and R. Agrawal Data privacy through optimal k-anonymization ICDE 2005 217 228
9. K. LeFevre, D.J. DeWitt, and R. Ramakrishnan Incognito: efficient full-domain k-anonymity SIGMOD 2005 49 60
10. R. Agrawal, and R. Srikant Fast algorithms for mining association rules in large databases VLDB 1994 487 499
11. G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas, and A. Zhu Achieving anonymity via clustering VLDB 2006
12. A. Machanavajjhala, J. Gehrke, and D. Kifer l-diversity: privacy beyond k-anonymity ICDE 2006
13. D.S. Johnson Approximation algorithms for combinatorial problems Journal of Computer and System Sciences 9 1974 256 278
14. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms second ed. 2001 McGraw Hill and MIT Press
15. J. Han, J. Pei, and Y. Yin Mining frequent patterns without candidate generation SIGMOD Conference 2000 1 12
16. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal Discovering frequent closed itemsets for association rules ICDT 1999 398 416
17. L. Willenborg, T. deWaal, Elements of statistical disclosure control, in: Lecture Notes in Statistics, Springer Verlag, 2000.
18. H.Y. Yi, B. Iglesia, V.J. Rayward-Smith, Using concept taxonomies for effective tree induction, in: CIS, no. 2, 2005, pp. 10111016.