Skip to main content

A Unified Framework for Privacy Preserving Data Clustering

  • Conference paper
Neural Information Processing (ICONIP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8834))

Included in the following conference series:

  • 4816 Accesses

Abstract

We study the problem of publishing a data table containing personal information, while ensuring individual privacy and maintaining data integrity to the possible extent. One popular technique in literature is through k-anonymization. A release is considered to preserve k-anonymity if the record corresponding to any person cannot be distinguished from that of at least k − 1 other individuals whose information also appears in the release. In order to achieve k-anonymity, we propose an unsupervised learning framework. We further show an instantiation of the framework, which leads to an exemplar-based clustering algorithm for practical applications, and report promising results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sweeney, L.: Uniqueness of simple demographics in the U.S. population (2000), http://privacy.cs.cmu.edu/

  2. Aggarwal, C., Yu, P.: Privacy-Preserving Data Mining: Models and Algorithms. Springer (2008)

    Google Scholar 

  3. Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R.H., Konwinski, A., Lee, G., Patterson, D.A., Rabkin, A., Stoica, I., Zaharia, M.: A view of cloud computing. Communications of the ACM 53, 50–58 (2010)

    Article  Google Scholar 

  4. Sweeney, L.: k-anonymity: A model for protecting privacy. Int. J. Uncertainty Fuzziness Knowledge Based Syst. 10 (2002)

    Google Scholar 

  5. Meyerson, A., Williams, R.: On the complexity of optimal K-anonymity. In: Proceedings of PODS 2004. ACM (2004)

    Google Scholar 

  6. Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Approximation algorithms for k-anonymity. Journal of Privacy Technology (2005)

    Google Scholar 

  7. Yu, T., Jajodia, S. (eds.): Secure Data Management in Decentralized Systems, vol. 33. Springer (2007)

    Google Scholar 

  8. MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1. University of California Press (1967)

    Google Scholar 

  9. Jain, A., Murty, M., Flynn, P.: Data clustering: A review. ACM Computing Surveys 31, 264–323 (1999)

    Article  Google Scholar 

  10. Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-diversity: Privacy beyond k-anonymity. In: Proceedings of ICDE 2006 (2006)

    Google Scholar 

  11. Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., Zhu, A.: Achieving anonymity via clustering. In: Proceedings of PODS 2006. ACM (2006)

    Google Scholar 

  12. Byun, J.-W., Kamra, A., Bertino, E., Li, N.: Efficient k-anonymization using clustering techniques. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 188–200. Springer, Heidelberg (2007)

    Google Scholar 

  13. Narasimhan, M., Bilmes, J.: Local search for balanced submodular clusterings. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (2007)

    Google Scholar 

  14. Li, W.: r-anonymized clustering. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds.) ICONIP 2012, Part I. LNCS, vol. 7663, pp. 455–464. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  15. Li, W., Schuurmans, D.: Modular community detection in networks. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, AAAI, pp. 1366–1371 (2011)

    Google Scholar 

  16. Li, W.: Modularity segmentation. In: Lee, M., Hirose, A., Hou, Z.-G., Kil, R.M. (eds.) ICONIP 2013, Part II. LNCS, vol. 8227, pp. 100–107. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  17. Frey, B.J., Dueck, D.: Clustering by passing messages between data points. Science 315 (2007)

    Google Scholar 

  18. Li, W.: Clustering with uncertainties: An affinity propagation-based approach. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds.) ICONIP 2012, Part V. LNCS, vol. 7667, pp. 437–446. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  19. Li, W., Xu, L., Schuurmans, D.: Facility locations revisited: An efficient belief propagation approach. In: 2010 IEEE International Conference on Automation and Logistics, pp. 408–413. IEEE (2010)

    Google Scholar 

  20. Bache, K., Lichman, M.: UCI machine learning repository (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Li, W. (2014). A Unified Framework for Privacy Preserving Data Clustering. In: Loo, C.K., Yap, K.S., Wong, K.W., Teoh, A., Huang, K. (eds) Neural Information Processing. ICONIP 2014. Lecture Notes in Computer Science, vol 8834. Springer, Cham. https://doi.org/10.1007/978-3-319-12637-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12637-1_40

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12636-4

  • Online ISBN: 978-3-319-12637-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics