Skip to main content

An Efficient and Dynamic Concept Hierarchy Generation for Data Anonymization

  • Conference paper
Distributed Computing and Internet Technology (ICDCIT 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7753))

Abstract

Protecting individual sensitive specific information has become an area of concern over the past one decade. Several techniques like k-anonymity and l-diversity employing generalization/suppression based on concept hierarchies (CHTS) were proposed in literature. The anonymization effectiveness depends on the CHT chosen from the various CHTS possible for a given attribute. This paper proposes a model for constructing dynamic CHT for numerical attributes which can be: 1) generated on the fly for both generalization/suppression; 2) dynamically adjusted based on a given k. The anonymized data using our method yielded 12% better utility when compared to existing methods. The results obtained after experimentation support our claims and are discussed in the paper.

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. HIPAA: Health Insurance Portability and Accountability Act (2002), http://www.hhs.gov/ocr/hipaa

  2. Sweeney, L.: k-anonymity: A Model for Protecting Privacy. International Journal on Uncertainty. Fuzziness and Knowledge-based Systems 10(5), 557–570 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Machanavajjhala, A., Gehrke, J., Kifer, D.: l-Diversity: Privacy beyond k-Anonymity. In: Proceedings of the IEEE ICDE, p. 24 (2006)

    Google Scholar 

  4. Wong, R.C., Li, J., Fu, A.W., Wang, K.: (α, k)-Anonymity: An Enhanced k-Anonymity Model for Privacy-Preserving Data Publishing. In: Proceedings of the SIGKDD (2006)

    Google Scholar 

  5. Li, N., Li, T., Venkatasubramanian, S.: t-Closeness: Privacy Beyond k-Anonymity and l-Diversity. In: Proceedings of the IEEE ICDE, pp. 106–115 (2007)

    Google Scholar 

  6. Sweeney, L.: Achieving k-Anonymity Privacy Protection Using Generalization and Suppression. International Journal on Uncertainty, Fuzziness, and Knowledge-based Systems 10(5), 571–588 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Iyengar, V.: Transforming Data to Satisfy Privacy Constraints. In: Proceedings of the ACM SIGKDD, pp. 279–288 (2002)

    Google Scholar 

  8. LeFevre, K., DeWitt, D., Ramakrishnan, R.: Mondrian Multidimensional k-Anonymity. In: Proceedings of the IEEE ICDE, Atlanta, Georgia (2006)

    Google Scholar 

  9. Samarati, P.: Protecting Respondents Identities in Microdata Release. IEEE Transactions on Knowledge and Data Engineering 13(6), 1010–1027 (2001)

    Article  Google Scholar 

  10. Xiao, X., Tao, Y.: Personalized Privacy Preservation. In: SIGMOD (2006)

    Google Scholar 

  11. Campan, A., Cooper, N.: On-the-Fly Hierarchies for Numerical Attributes in Data Anonymization. In: Jonker, W., Petković, M. (eds.) SDM 2010. LNCS, vol. 6358, pp. 13–25. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Tan, P.-N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison Wesley, Reading (2005)

    Google Scholar 

  13. Byun, J.W., Kamra, A., Bertino, E., Li, N.: Efficient k-Anonymity using Clustering Techniques. CERIAS Technical Report 2006-10 (2006)

    Google Scholar 

  14. UCI Repository of Machine Learning databases, http://archive.ics.uci.edu/ml/

  15. Campan, A., Cooper, N., Truta, T.M.: On-the-Fly Generalization Hierarchies for Numerical Attributes Revisited. In: Jonker, W., Petković, M. (eds.) SDM 2011. LNCS, vol. 6933, pp. 18–32. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adusumalli, S.K., Valli Kumari, V. (2013). An Efficient and Dynamic Concept Hierarchy Generation for Data Anonymization. In: Hota, C., Srimani, P.K. (eds) Distributed Computing and Internet Technology. ICDCIT 2013. Lecture Notes in Computer Science, vol 7753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36071-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36071-8_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36070-1

  • Online ISBN: 978-3-642-36071-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics