A k-anonymity clustering method for effective data privacy preservation

30Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data privacy preservation has drawn considerable interests in data mining research recently. The k-anonymity model is a simple and practical approach for data privacy preservation. This paper proposes a novel clustering method for conducting the k-anonymity model effectively. In the proposed clustering method, feature weights are automatically adjusted so that the information distortion can be reduced. A set of experiments show that the proposed method keeps the benefit of scalability and computational efficiency when comparing to other popular clustering algorithms. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Chiu, C. C., & Tsai, C. Y. (2007). A k-anonymity clustering method for effective data privacy preservation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4632 LNAI, pp. 89–99). Springer Verlag. https://doi.org/10.1007/978-3-540-73871-8_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free