Skip to main content

On the Relations between Retention Replacement, Additive Perturbation, and Randomisations for Nominal Attributes in Privacy Preserving Data Mining

  • Conference paper
  • 1260 Accesses

Part of the Lecture Notes in Computer Science book series (LNAI,volume 7661)

Abstract

There are several randomisation-based methods in Privacy Preserving Data Mining. In this paper we discuss the additive perturbation and the retention replacement for continuous attributes. We also investigate the randomisations for binary and nominal attributes. We focus on the relations between them, similarities, and differences. We also discuss properties of randomisation-based methods which are important in real applications during implementation and the usage of particular randomisations. We have proven that the retention replacement can be implemented with the randomisation for nominal attributes. We have also shown that the additive perturbation can be approximated with the aforementioned solution for nominal attributes.

Keywords

  • Probability Density Function
  • Continuous Attribute
  • Association Rule Mining
  • Privacy Preserve
  • Nominal Attribute

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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. Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Chen, W., Naughton, J.F., Bernstein, P.A. (eds.) SIGMOD Conference, pp. 439–450. ACM (2000)

    Google Scholar 

  2. Kim, J.J., Winkler, W.E.: Multiplicative noise for masking continuous data. Technical report, Statistical Research Division, US Bureau of the Census, Washington, D.C. (2003)

    Google Scholar 

  3. Chen, K., Liu, L.: Privacy preserving data classification with rotation perturbation. In: ICDM, pp. 589–592. IEEE Computer Society (2005)

    Google Scholar 

  4. Agrawal, R., Srikant, R., Thomas, D.: Privacy preserving olap. In: SIGMOD 2005: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 251–262. ACM, New York (2005)

    CrossRef  Google Scholar 

  5. Rizvi, S.J., Haritsa, J.R.: Maintaining data privacy in association rule mining. In: VLDB 2002: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 682–693. VLDB Endowment (2003)

    Google Scholar 

  6. Andruszkiewicz, P.: Privacy preserving data mining on the example of classification. Master’s thesis, Warsaw University of Technology (2005) (in Polish)

    Google Scholar 

  7. Andruszkiewicz, P.: Privacy preserving classification for continuous and nominal attributes. In: Proceedings of the 16th International Conference on Intelligent Information Systems (2008)

    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

Andruszkiewicz, P. (2012). On the Relations between Retention Replacement, Additive Perturbation, and Randomisations for Nominal Attributes in Privacy Preserving Data Mining. In: Chen, L., Felfernig, A., Liu, J., Raś, Z.W. (eds) Foundations of Intelligent Systems. ISMIS 2012. Lecture Notes in Computer Science(), vol 7661. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34624-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34624-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)