Abstract
The key idea of our k-anonymity is to cluster the personal data based on the density which is measured by the k-Nearest-Neighbor (KNN) distance. We add a constraint that each cluster contains at least k records which is not the same as the traditional clustering methods, and provide an algorithm to come up with such a clustering. We also develop more appropriate metrics to measure the distance and information loss, which is suitable in both numeric and categorical attributes. Experiment results show that our algorithm causes significantly less information loss than previous proposed clustering algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Achieving Anonymity via Clustering. In: PODS’06, pp. 26–28 (2006)
Blake, C., Merz, C.: UCI repository of machine learning databases (1998)
Byun, J.-W., Kamra, A., Bertino, E., Li, N.: Efficient k-Anonymity Using Clustering Technique. Cerias Tech. Report (2006)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithm, 2nd edn. MIT Press, Cambridge (2001)
Fevre, K.L., Dewitt, D.J., Ramakrishnan, R.: Incognito: Efficient Full-Domain k-Aonymity. In: SIGMOD 2005, June, pp. 14–16 (2005)
Fung, B.C.M., Wang, K., Yu, P.S.: Top-down Specialization for Information and Privacy Preservation. In: The twenty-first International Conference on Data Engineering, ICDE (2005)
Li, J., Wong, R.C.-W., Fu, A.W.-c., Pei, J.: Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2006. LNCS, vol. 4081, pp. 405–416. Springer, Heidelberg (2006)
Sweeney, L.: Achieving k-Anonymity Privacy Protection Using Generalization and Suppression. International Journal of Uncertainty, Fuzziness and Knowledge-Based System 10(5), 571–588 (2002)
Wang, K., Yu, P.S., Chakraborty, S.: Bottom-up Generalization: A Data Mining Solution to Privacy Protection. In: ICDM04: The fourth IEEE International Conference on Data Mining, pp. 249–256 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zhu, H., Ye, X. (2007). Achieving k-Anonymity Via a Density-Based Clustering Method. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_76
Download citation
DOI: https://doi.org/10.1007/978-3-540-72524-4_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72483-4
Online ISBN: 978-3-540-72524-4
eBook Packages: Computer ScienceComputer Science (R0)