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

  • Piotr Andruszkiewicz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7661)


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.


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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. 3.
    Chen, K., Liu, L.: Privacy preserving data classification with rotation perturbation. In: ICDM, pp. 589–592. IEEE Computer Society (2005)Google Scholar
  4. 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)CrossRefGoogle Scholar
  5. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Piotr Andruszkiewicz
    • 1
  1. 1.Institute of Computer ScienceWarsaw University of TechnologyPoland

Personalised recommendations