Skip to main content

Privacy Preserving Models of k-NN Algorithm

  • Conference paper
Computer Recognition Systems 4

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 95))

Abstract

The paper focuses on the problem of privacy preserving for classification task. This issue is quite an important subject for the machine learning approach based on distributed databases. On the basis of the study of available works devoted to privacy we propose its new definition and its taxonomy. We use this taxonomy to create several modifications of k-nearest neighbors classifier which are consistent with the proposed privacy levels. Their computational complexity are evaluated on the basis of computer experiments.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Aha, D.W., Kibler, D., Albert, M.: K Instance-Based Learning Algorithms. Machine Learning 6, 37–66 (1991)

    Google Scholar 

  2. Alpaydin, E.: Introduction to Machine Learning, 2nd edn. The MIT Press, London (2010)

    MATH  Google Scholar 

  3. Angiulli, F., Folino, G.: Distributed Nearest Neighbor Based Condensation of Very Large Datasets. IEEE Transactions on Knowledge and Data Engineering 19(12), 1593–1606 (2007)

    Article  Google Scholar 

  4. Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. School of Information and Computer Science, University of California, Irvine (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html

  5. Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: Proc. of the 23rd International Conference on Machine Learning, Pittsburgh, PA, pp. 97–104 (2006)

    Google Scholar 

  6. Chitti, S., Liu, L., Xiong, L.: Mining Multiple Private Databases isung Privacy Preserving kNN Classifier, Technical Reports TR-2006-008, Emory University (2006)

    Google Scholar 

  7. Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving data mining. In: SIGKDD Explorations, pp. 28–34 (2002)

    Google Scholar 

  8. Cost, S., Salzberg, S.: A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features. Machine Learning 10(1), 57–78 (1993)

    Google Scholar 

  9. Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. on Inform. Theory 13(1), 21–27 (1967)

    Article  MATH  Google Scholar 

  10. Dasarathy, B.: Nearest Neighbor (NN) Norms NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos (1991)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  12. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. Wiley Interscience, NewYork (2001)

    MATH  Google Scholar 

  13. Freitas, A.A., Lavington, S.H.: Mining Very Large Databases with Parallel Processing. Kluwer Academic Publishers, Boston (1998)

    MATH  Google Scholar 

  14. Gantz, J., Reinsel, D.: As the Economy Contracts, the Digital Universe Expands. IDC Multimedia Whitepaper (2009)

    Google Scholar 

  15. Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. on Inform. Th. 14(3), 515–516 (1968)

    Article  Google Scholar 

  16. Hacigumus, H., Iyer, B., Li, C., Mehrotra, S.: Executing sql over encrypted data in the database service provider model. In: ACM SIGMOD Conference (2002)

    Google Scholar 

  17. Han, J.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publ. Inc., San Francisco (2005)

    Google Scholar 

  18. Jajodia, S., Sandhu, R.: Toward a multilevel secure relational data model. In: ACM SIGMOD Conference (1991)

    Google Scholar 

  19. Kantarcioglu, M., Clifton, C.: Privacy preserving k-nn classifier. In: IEEE International Conference on Data Engineering, ICDE (2005)

    Google Scholar 

  20. Kuncheva, L.I.: Combining pattern classifiers: Methods and algorithms. Wiley-Interscience, New Jersey (2004)

    Book  MATH  Google Scholar 

  21. Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. Journal of Cryptology 15(3), 177–206 (2004)

    Article  MathSciNet  Google Scholar 

  22. Moor, J.H.: The future of computer ethics: You ain’t seen nothing yet! In: Ethics and Information Technology, vol. 3, pp. 89–91. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  23. Nissenbaum, H.: Can we Protect Privacy in Public? In: Computer Ethics Philosophical Enquiry ACM/SIGCAS Conference, Rotterdam, The Netherlands (1997)

    Google Scholar 

  24. Teng, Z., Du, W.: A hybrid multi-group privacypreserving approach for building decision trees. In: Proceedings of the 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining PAKDD 2006, pp. 296–307 (2006)

    Google Scholar 

  25. Westin, A.F.: Privacy and Freedom. The Bodley Head Ltd (1970)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krawczyk, B., Wozniak, M. (2011). Privacy Preserving Models of k-NN Algorithm. In: Burduk, R., Kurzyński, M., Woźniak, M., Żołnierek, A. (eds) Computer Recognition Systems 4. Advances in Intelligent and Soft Computing, vol 95. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20320-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20320-6_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20319-0

  • Online ISBN: 978-3-642-20320-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics