Achieving k-anonymity via a density-based clustering method

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

Volumn 4505 LNCS, Issue , 2007, Pages 745-752

  Zhu, Hua ^a   Ye, Xiaojun ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; INFORMATION ANALYSIS; NUMERICAL ANALYSIS;

DENSITY-BASED CLUSTERING METHOD; K-ANONYMITY; K-NEAREST-NEIGHBOR (KNN) DISTANCE;

CLUSTERING ALGORITHMS;

EID: 38049054142     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72524-4_76     Document Type: Conference Paper

References (9)

1. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu.: Achieving Anonymity via Clustering. PODS'06, (2006) 26-28.
2. C. Blake and C. Merz.: UCI repository of machine learning databases (1998).
3. J.-W. Byun, A. Kamra, E. bertino, and Ninghui. Li.: Efficient k-Anonymity Using Clustering Technique. Cerias Tech Report (2006).
4. Thomas H. Cormen, C.E. Leiserson, RL. Rivest.: Introduction to algorithm, Second Edition, published by MIT press (2001).
5. K. L. Fevre, D. J. Dewitt, and R. Ramakrishnan.: Incognito: Efficient Full-Domain k-Aonymity. In SIGMOD 2005 June (2005) 14-16.
6. B.C.M. Fung, K. Wang, and P.S. Yu.: Top-down Specialization for Information and Privacy Preservation. In the twenty-first International Conference on Data Engineering (ICDE) (2005).
7. Jiuyong. Li, Raymond. Chi-Wing. W., Ada F., and Jian P.: Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures. DaWaK 2006, LNCS 4081, (2006) 405-416.
8. L. Sweeney.: Achieving k-Anonymity Privacy Protection Using Generalization and Suppression. International Journal of Uncertainty, Fuzziness and Knowledge-Based System Vol. 10, No. 5 (2002) 571-588
9. 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, (2004) 249-256.