Speeding up clustering-based k-anonymisation algorithms with pre-partitioning

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

Volumn 4587 LNCS, Issue , 2007, Pages 203-214

  Loukides, Grigorios ^a   Shao, Jianhua ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL EFFICIENCY; DATABASE SYSTEMS;

ANONYMIZATION; DATASETS; PRE-PARTITIONING;

DATA PRIVACY;

EID: 38149078956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73390-4_23     Document Type: Conference Paper

References (16)

1. Sweeney, L.: k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems 10, 557-570 (2002)
2. LeFevre, K., DeWitt, D., Ramakrishnan, R.: Mondrian multidimensional k-anonymity. In: ICDE '06, vol. 25 (2006)
3. Bayardo, R., Agrawal, R.: Data privacy through optimal k-anonymization. In: ICDE '05, pp. 217-228 (2005)
4. Byun, J., Kamra, A., Bertino, E., Li, N.: Efficient k-anonymity using clustering technique. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA '07. LNCS, vol. 4443. Springer, Heidelberg (to appear, 2007)
5. Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., Fu, A.W.C.: Utility-based anonymization using local recoding. In: KDD '06, pp. 785-790 (2006)
6. Loukides, G., Shao, J.: Capturing data usefulness and privacy protection in kanonymisation. In: SAC '07, pp. 370-374 (2007)
7. Thaper, N., Guha, S., Indyk, P., Koudas, N.: Dynamic multidimensional histograms. In: SIGMOD '02, pp. 428-439 (2002)
8. Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: 1-diversity: Privacy beyond k-anonymity. In: ICDE '06, vol. 24 (2006)
9. Aggarwal, G., Kenthapadi, F., Motwani, K., Panigrahy, R., Thomas, D., Zhu, A.: Approximation algorithms for k-anonymity. Journal of Privacy Technology (2005)
10. McCallum, A., Nigam, K., Ungar, L.: Efficient clustering of high-dimensional data sets with application to reference matching. In: KDD '00, pp. 169-178 (2000)
11. Guha, S., Rastogi, R., Shim, K.: Cure: an efficient clustering algorithm for large databases. In: SIGMOD '98, pp. 73-84 (1998)
12. Oliveira, S., Zaiane, O.: Privacy preserving clustering by data transformation. In: Proceedings of the XVIII SBBD, pp. 304-318 (2003)
13. Friedman, J., Bentley, J., Finkel, R.: An algorithm for finding best matches in logarithmic time. ACM Trans. on Mathematical Software 3(3) (1977)
14. Hettich, S., Merz, C.: Uci repository of machine learning databases (1998)
15. Narayan, B., Murthy, C., Pal, S.K.: Maxdiff kd-trees for data condensation. Pattern Recognition Letters 27, 187-200 (2006)
16. Byun, J., Sohn, Y., Bertino, E., Li, N.: Secure anonymization for incremental datasets. In: Secure Data Management '06, pp. 48-63 (2006)