Skip to main content

A Sensitive Attribute Based Clustering Method for k-Anonymization

  • Conference paper
  • 2787 Accesses

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

Abstract

In medical organizations large amount of personal data are collected and analyzed by the data miner or researcher, for further perusal. However, the data collected may contain sensitive information such as specific disease of a patient and should be kept confidential. Hence, the analysis of such data must ensure due checks that ensure protection against threats to the individual privacy. In this context, greater emphasis has now been given to the privacy preservation algorithms in data mining research. One of the approaches is anonymization approach that is able to protect private information; however, valuable information can be lost. Therefore, the main challenge is how to minimize the information loss during an anonymization process. The proposed method is grouping similar data together based on sensitive attribute and then anonymizes them. Our experimental results show the proposed method offers better outcomes with respect to information loss and execution time.

Keywords

  • Privacy preservation
  • data mining

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    CrossRef  Google Scholar 

  2. Chiu, C.C., Tsai, C.Y.: A k-Anonymity Clustering Method for Effective Data Privacy Preservation. In: Alhajj, R., Gao, H., Li, X., Li, J., Zaïane, O.R. (eds.) ADMA 2007. LNCS (LNAI), vol. 4632, pp. 89–99. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  3. Gonzalez, T.Z.: Clustering to minimize the maximum intercluster distance. Theory of Computer Science 38, 293–306 (1985)

    CrossRef  MATH  Google Scholar 

  4. Lin, J.L., Wei, M.C.: An efficient clustering method for k-anonymization. In: International Workshop on Privacy and Anonymity in Information Society (2008)

    Google Scholar 

  5. Loukides, G., Shao, J.: Capturing data usefulness and privacy protection in k-anonymization. In: ACM Symposium on Applied Computing (2007)

    Google Scholar 

  6. Md. Enamul, K., Hua, W., Elisa, B.: Efficient systematic clustering method for k-anonymization. Springer, Heidelberg (2011)

    Google Scholar 

  7. Hettich, C.B.S., Merz, C.: UCI repository of machine learning databases (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bhaladhare, P., Jinwala, D. (2012). A Sensitive Attribute Based Clustering Method for k-Anonymization. In: Thilagam, P.S., Pais, A.R., Chandrasekaran, K., Balakrishnan, N. (eds) Advanced Computing, Networking and Security. ADCONS 2011. Lecture Notes in Computer Science, vol 7135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29280-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29280-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29279-8

  • Online ISBN: 978-3-642-29280-4

  • eBook Packages: Computer ScienceComputer Science (R0)