A framework for condensation-based anonymization of string data

Data Mining and Knowledge Discovery

Volumn 16, Issue 3, 2008, Pages 251-275

  Aggarwal, Charu C ^a   Yu, Philip S ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Condensation; Privacy; Strings

Indexed keywords

CONDENSATION; DATA STRUCTURES; PROBLEM SOLVING; STATISTICS;

ANONYMIZATION; STATISTICAL CHARACTERISTICS;

DATA MINING;

EID: 42749091916     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-008-0088-z     Document Type: Article

References (23)

1. Aggarwal CC (2002) On effective classification of strings with wavelets. In: ACM KDD conference
2. Aggarwal CC (2004) On k-anonymity and the curse of dimensionality. In: VLDB conference. Scalable clustering with balancing constraints
3. Agrawal D, Aggarwal CC (2002) On the design and quantification of privacy preserving data mining algorithms. In: ACM PODS conference
4. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the VLDB conference
5. Agrawal R, Srikant R (2000) Privacy preserving data mining. In: Proceedings of the ACM SIGMOD conference
6. Aggarwal CC, Yu PS (2004) A condensation based approach to privacy preserving data mining. In: EDBT conference
7. Aggarwal CC, Yu PS (2005) On variable constraints in privacy preserving data mining. In: ACM SIAM data mining conference
8. Aggarwal CC, Yu PS (2007) On anonymization of strings. In: SIAM conference on data mining. http://www.charuaggarwal.net/str.pdf
9. Banerjee A and Ghosh J (2006). Scalable clustering with balancing constraints. Data Min Knowl Discov J 13: 365-395
10. Bayardo RJ, Agrawal R (2005) Data privacy through optimal k-anonymization. In: ICDE conference
11. Evfimievski A, Srikant R, Agrawal R, Gehrke J (2002) Privacy preserving mining of association rules. In: KDD conference
12. Iyengar V (2000) Transforming data to satisfy privacy constraints. In: ACM KDD conference
13. Kifer D, Gehrke J (2006) Injecting utility into anonymized data sets. In: ACM SIGMOD conference
14. LeFevre K, Dewitt DJ, Ramakrishnan R (2006) Mondrian multi-dimensional k-anonymity. In: ICDE conference
15. Machanavajjhala A, Gehrke J, Kifer D, Venkitasubramaniam M (2006) l-Diversity: privacy beyond k-anonymity. In: ICDE conference
16. Malin B (2004) Why methods for genomic data privacy fail and what we can do to fix it. In: AAAS Annual Meeting, Seattle, WA
17. Malin B, Sweeney L (2001) Re-identification of DNA through an automated linkage process. In: Proceedings, Journal of American Medical Informatics Associations. Hanley & Belfus, Inc, Washington, DC, pp 423-427
18. Meyerson A, Williams R (2004) On the complexity of optimal k-anonymity. In: ACM PODS conference
19. Needleman S and Wunsch C (1970). A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 48(3): 443-453
20. Rizvi S, Haritsa J (2002) Maintaining data privacy in association rule mining. In: VLDB conference
21. Samarati P, Sweeney L (1998) Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. In: Proceedings of the IEEE symposium on research in security and privacy
22. Sweeney L (1996) Replacing personally identifying information in medical records: the scrub system. In: Proceedings of the AMIA symposium
23. Wang K, Fung BCM, Yu PS (2006) Handicapping attacker's confidence: an alternative to k-anonymization. Knowledge Inform Sys Int J