Achieving k-anonymity by clustering in attribute hierarchical structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4081 LNCS, Issue , 2006, Pages 405-416

  Jiuyong, Li ^a   Wong, Raymond Chi Wing ^b   Fu, Ada Wai Chee ^b   Jian, Pei ^c  

^a UNIVERSITY OF SOUTHERN QUEENSLAND   (Australia)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA ACQUISITION; DATA RECORDING; HIERARCHICAL SYSTEMS; NUMERICAL METHODS; RISK ASSESSMENT;

DATA SETS; GLOBAL RECODING METHOD; HIERARCHICAL STRUCTURES; K-ANONYMITY;

DATA STRUCTURES;

EID: 33751359260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (24)

1. C. C. Aggarwal. On k-anonymity and the curse of dimensionality. In VLDB '05: Proceedings of the 31st international conference on Very large data bases, pages 901-909. VLDB Endowment, 2005.
2. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. Anonymizing tables. In ICDT05: Tenth International Conference on Database Theory, pages 246-258, 2005.
3. G. Aggarwal, T. Feder, K. Kenthapadi, A. Zhu, R. Panigrahy, and D. Thomas. Achieving anonymity via clustering in a metric space. In PODS '06: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2006.
4. D. Agrawal and C. C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In PODS '01: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 247-255, New York, NY, USA, 2001. ACM Press.
5. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proc. of the ACM SIGMOD Conference on Management of Data, pages 439-450. ACM Press, May 2000.
6. R. Bayardo and R. Agrawal. Data privacy through optimal k-anonymization. In ICDE05: The 21st International Conference on Data Engineering, pages 217-228, 2005.
7. E. K. C. Blake and C. J. Merz. UCI repository of machine learning databases, http://www.ics.uci.edu/~mlearn/MLRepository.html, 1998.
8. J. Domingo-Ferrer and J. M. Mateo-Sanz. Practical data-oriented microaggregation for statistical disclosure control. IEEE Transactions on Knowledge and Data Engineering, 14(1):189-201, 2002.
9. J. Domingo-Ferrer and V. Torra. Ordinal, continuous and heterogeneous k-anonymity through microaggregation. Data Mining and Knowledge Discovery, 11(2):195-212, 2005.
10. B. C. M. Fung, K. Wang, and P. S. Yu. Top-down specialization for information and privacy preservation. In ICDE05: The 21st International Conference on Data Engineering, pages 205-216, 2005.
11. A. Hundepool and L. Willenborg, μ-and τ- argus: software for statistical disclosure control. In Third international seminar on statsitcal confidentiality, Bled, 1996.
12. V. S. Iyengar. Transforming data to satisfy privacy constraints. In KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 279-288, 2002.
13. K. LeFevre, D. DeWitt, , and R. Ramakrishnan. Multidimensional k-anonymity. In M. Technical Report 1521, University of Wisconsin, 2005.
14. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Incognito: Efficient full-domain k-anonymity. In SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pages 49-60, 2005.
15. Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3):177-206, 2002.
16. A. Machanavajjhala, J. Gehrke, and D. Kifer. l-diversity: privacy beyond k-anonymity. In To appear in the 22st International Conference on Data Engineering (ICDE06), 2006.
17. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In PODS04: Proceedings of the twenty fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 223-228, 2004.
18. S. Rizvi and J. Haritsa. Maintaining data privacy in association rule mining. In Proceedings of the 28th Conference on Very Large Data Base (VLDB02), pages 682-693. VLDB Endowment, 2002.
19. P. Samarati. Protecting respondents' identities in microdata release. IEEE Transactions on Knowledge and Data Engineering, 13(6):1010-1027, 2001.
20. L. Sweeney. Achieving k-anonymity privacy protection using generalization and suppression. International journal on uncertainty, Fuzziness and knowldege based systems, 10(5):571-588, 2002.
21. L. Sweeney. k-anonymity: a model for protecting privacy. International journal on uncertainty, Fuzziness and knowldege based systems, 10(5):557-570, 2002.
22. J. Vaidya and C. Clifton. Privacy-preserving k-means clustering over vertically partitioned data. In The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 24-27, Washington, DC, 2003. ACM Press.
23. K. Wang, P. S. Yu, and S. Chakraborty. Bottom-up generalization: A data mining solution to privacy protection. In ICDM04: The fourth IEEE International Conference on Data Mining, pages 249-256, 2004.
24. R. Wright and Z. Yang. Privacy-preserving bayesian network structure computation on distributed heterogeneous data. In KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 713-718, New York, NY, USA, 2004. ACM Press.