Advertisement

Distributed Privacy-Preserving Minimal Distance Classification

  • Bartosz Krawczyk
  • Michał Woźniak
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8073)

Abstract

The paper focuses on the problem of preserving privacy for a minimal distance classifier working in the distributed environment. On the basis of the study of available works devoted to privacy aspects of machine learning methods, we propose the novel definition and taxonomy of privacy. This taxonomy was used to develop new effective classification algorithms which can work in distributed computational environment and assure a chosen privacy level. Instead of using additional algorithms for secure computing, the privacy assurance is embedded in the classification process itself. This lead to a significant reduction of the overall computational complexity what was confirmed by the computer experiments which were carried out on diverse benchmark datasets.

Keywords

privacy preserving distributed data mining classification k-NN 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alpaydin, E.: Introduction to Machine Learning, 2nd edn. The MIT Press, London (2010)zbMATHGoogle Scholar
  2. 2.
    Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html
  3. 3.
    Chitti, S., Liu, L., Xiong, L.: Mining Multiple Private Databases using Privacy Preserving kNN Classifier, Technical Reports TR-2006-008, Emory University (2006)Google Scholar
  4. 4.
    Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving data mining. SIGKDD Explorations, 28–34 (2002)Google Scholar
  5. 5.
    Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. on Inform. Theory 13(1), 21–27 (1967)zbMATHCrossRefGoogle Scholar
  6. 6.
    Devroye, L.: On the inequality of cover and hart in nearest neighbor discrimination. IEEE Trans. on Pat. Anal. and Mach. Intel. 3, 75–78 (1981)zbMATHCrossRefGoogle Scholar
  7. 7.
    Han, J.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publ. Inc., San Francisco (2005)Google Scholar
  8. 8.
    Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. Journal of Cryptology 15(3), 177–206 (2004)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Lindell, Y., Pinkas, B.: A proof of security of yao’s protocol for two-party computation. Journal of Cryptology 22(2), 161–188 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Moor, J.H.: The future of computer ethics: You ain’t seen nothin’ yet! Ethics and Information Technology 3, 89–91 (2001)CrossRefGoogle Scholar
  11. 11.
    Nissenbaum, H.: Can we Protect Privacy in Public? In: Computer Ethics Philosophical Enquiry ACM/SIGCAS Conference, Rotterdam, The Netherlands (1997)Google Scholar
  12. 12.
    Westin, A.F.: Privacy and Freedom. The Bodley Head Ltd. (1970)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Bartosz Krawczyk
    • 1
  • Michał Woźniak
    • 1
  1. 1.Department of Systems and Computer NetworksWroclaw University of TechnologyWroclawPoland

Personalised recommendations