An efficient clustering algorithm for k-anonymisation

Journal of Computer Science and Technology

Volumn 23, Issue 2, 2008, Pages 188-202

  Loukides, Grigorios ^a   Shao, Jian Hua ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

Data privacy; Greedy clustering; K anonymisation

Indexed keywords

DATA UTILITY; K-ANONYMISATION; QUERY ANSWERING;

CLUSTERING ALGORITHMS; DATA STRUCTURES; HEURISTIC METHODS; QUERY PROCESSING;

DATA PRIVACY;

EID: 42149175998     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-008-9121-3     Document Type: Article

References (22)

1. Li N, Li T, Venkatasubramanian S. t-closeness: Privacy beyond k-anonymity and l-diversity. In Proc. ICDE, Istanbul, Turkey, 2007, pp.106-115.
2. Loukides G, Shao J. Speeding up clustering-based k-anonymisation algorithms with pre-partitioning. In Proc. The 24th British National Conference on Databases, Glasgow, UK, 2007, pp.203-214.
3. Loukides G, Shao J. Capturing data usefulness and privacy protection in K-anonymisation. In Proc. The 22nd Annual ACM Symposium on Applied Computing, Seoul, Korea, 2007, pp.370-374.
4. Sweeney L. K-anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems, 2002, 10(5): 557-570.
5. Samarati P. Protecting respondents identities in microdata release. IEEE Transactions on Knowledge and Data Engineering, 2001, 13(9): 1010-1027.
6. LeFevre K, DeWitt D J, Ramakrishnan R. Mondrian multi-dimensional K-anonymity. In Proc. ICDE, Atlanta, Georgia, USA, 2006, p.25.
7. Bayardo R J, Agrawal R. Data privacy through optimal k-anonymization. In Proc. ICDE, Tokyo, Japan, 2005, pp.217-228.
8. Iyengar V S. Transforming data to satisfy privacy constraints. In Proc. KDD, Edmonton, Alberta, Canada, 2002, pp.279-288.
9. LeFevre K, DeWitt D J, Ramakrishnan R. Workload-aware anonymization. In Proc. KDD, Philadelphia, PA, USA, 2006, pp.277-286.
10. Fung B C M, Wang K, Yu P S. Top-down specialization for information and privacy preservation. In Proc. ICDE, Tokyo, Japan, 2005, pp.205-216.
11. Teng Z, Du W. Comparisons of k-anonymization and randomization schemes under linking attacks. In Proc. ICDM, Hong Kong, China, 2006, pp.1091-1096.
12. Machanavajjhala A Gehrke J, D Kifer et al. l-diversity: Privacy beyond k-anonymity. In Proc. ICDE, Atlanta, Georgia, USA, 2006, p.24.
13. Koudas N, Zhang Q, Srivastava D et al. Aggregate query answering on anonymized tables. In Proc. ICDE, Istanbul, Turkey, 2007, pp.116-125.
14. Hettich S, Merz C J. UCI Repository of machine learning databases, 1999, http://kdd.ics.uci.edu.
15. LeFevre K, DeWitt D J, Ramakrishnan R. Incognito: Efficient full-domain K-anonymity. In Proc. SIGMOD, Baltimore, Maryland, USA, 2005, pp.49-60.
16. Xu J, Wang W, Pei J et al. Utility-based anonymization using local recoding. In Proc. KDD, Philadelphia, PA, USA, 2006, pp.785-790.
17. Aggarwal C C, Yu P S. A condensation approach to privacy preserving data mining. In Proc. The 9th International Conference on Extending Database Technology, Heraklion, Crete, Greece, 2004, pp.183-199.
18. Byun J, Kamra E, Bertino E et al. Efficient k-anonymization using clustering techniques. In Proc. The 12th International Conference on Database Systems for Advanced Applications, 2007, Bangkok, Thailand, pp.188-200.
19. Zhou J, Sander J. Data bubbles for non-vector data: Speeding-up hierarchical clustering in arbitrary metric spaces. In Proc. VLDB, Berlin, Germany, 2003, pp.452-463.
20. Narayan B L, Murthy C A, Pal S K. Maxdiff kd-trees for data condensation. Pattern Recogn. Lett., 27(3): 187-200.
21. Xiao X, Tao Y. Anatomy: Simple and effective privacy preservation. In Proc. VLDB, Seoul, Korea, 2006, pp.139-150.
22. Gehrke J, Ramakrishnan R, Ganti V. RainForest - A Framework for fast decision tree construction of large datasets. In Proc. VLDB, New York City, USA, 1998, pp.416-427.