Skip to main content

Retention Replacement in Privacy Preserving Classification

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2012)

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

  • 722 Accesses

Abstract

In privacy preserving classification based on randomisation, the additive and multiplicative perturbation methods were shown as preserving little privacy. Thus, we focus on the retention replacement randomisation-based method for classification over centralised data. We propose how to build privacy preserving classifiers over data distorted by means of the retention replacement randomisation-based method. We consider the eager and lazy classifiers based on emerging patterns and the decision tree. We have tested our proposal and show that the high accuracy results in classification can be obtained with the usage of the retention replacement method.

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. 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. Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: ICDM, pp. 99–106. IEEE Computer Society (2003)

    Google Scholar 

  5. Liu, K., Giannella, C.M., Kargupta, H.: An Attacker’s View of Distance Preserving Maps for Privacy Preserving Data Mining. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 297–308. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

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

    Google Scholar 

  7. Andruszkiewicz, P.: Probability distribution reconstruction for nominal attributes in privacy preserving classification. In: ICHIT 2008: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology, pp. 494–500. IEEE Computer Society, Washington, DC (2008)

    Chapter  Google Scholar 

  8. Andruszkiewicz, P.: Privacy preserving classification with emerging patterns. In: Saygin, Y., Yu, J.X., Kargupta, H., Wang, W., Ranka, S., Yu, P.S., Wu, X. (eds.) ICDM Workshops, pp. 100–105. IEEE Computer Society (2009)

    Google Scholar 

  9. Andruszkiewicz, P.: Lazy Approach to Privacy Preserving Classification with Emerging Patterns. In: Ryżko, D., Rybiński, H., Gawrysiak, P., Kryszkiewicz, M. (eds.) Emerging Intelligent Technologies in Industry. SCI, vol. 369, pp. 253–268. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Liu, K., Giannella, C., Kargupta, H.: A survey of attack techniques on privacy-preserving data perturbation methods. In: Aggarwal, C.C., Yu, P.S. (eds.) Privacy-Preserving Data Mining. Advances in Database Systems, vol. 34, pp. 359–381. Springer (2008)

    Google Scholar 

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

    Chapter  Google Scholar 

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

    Google Scholar 

  13. Andruszkiewicz, P.: Optimization for MASK Scheme in Privacy Preserving Data Mining for Association Rules. In: Kryszkiewicz, M., Peters, J.F., Rybiński, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 465–474. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)

    Google Scholar 

  15. Shafer, J.C., Agrawal, R., Mehta, M.: Sprint: A scalable parallel classifier for data mining. In: Vijayaraman, T.M., Buchmann, A.P., Mohan, C., Sarda, N.L. (eds.) Proceedings of 22th International Conference on Very Large Data Bases, VLDB 1996, September 3-6, pp. 544–555. Morgan Kaufmann, Mumbai (1996)

    Google Scholar 

  16. van Rijsbergen, C.J.: Information Retrieval. Butterworth-Heinemann, Newton (1979)

    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). Retention Replacement in Privacy Preserving Classification. In: Morzy, T., Härder, T., Wrembel, R. (eds) Advances in Databases and Information Systems. ADBIS 2012. Lecture Notes in Computer Science, vol 7503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33074-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33074-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33073-5

  • Online ISBN: 978-3-642-33074-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics