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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alpaydin, E.: Introduction to Machine Learning, 2nd edn. The MIT Press, London (2010)
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
Chitti, S., Liu, L., Xiong, L.: Mining Multiple Private Databases using Privacy Preserving kNN Classifier, Technical Reports TR-2006-008, Emory University (2006)
Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving data mining. SIGKDD Explorations, 28–34 (2002)
Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. on Inform. Theory 13(1), 21–27 (1967)
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)
Han, J.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publ. Inc., San Francisco (2005)
Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. Journal of Cryptology 15(3), 177–206 (2004)
Lindell, Y., Pinkas, B.: A proof of security of yao’s protocol for two-party computation. Journal of Cryptology 22(2), 161–188 (2009)
Moor, J.H.: The future of computer ethics: You ain’t seen nothin’ yet! Ethics and Information Technology 3, 89–91 (2001)
Nissenbaum, H.: Can we Protect Privacy in Public? In: Computer Ethics Philosophical Enquiry ACM/SIGCAS Conference, Rotterdam, The Netherlands (1997)
Westin, A.F.: Privacy and Freedom. The Bodley Head Ltd. (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krawczyk, B., Woźniak, M. (2013). Distributed Privacy-Preserving Minimal Distance Classification. In: Pan, JS., Polycarpou, M.M., Woźniak, M., de Carvalho, A.C.P.L.F., Quintián, H., Corchado, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2013. Lecture Notes in Computer Science(), vol 8073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40846-5_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-40846-5_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40845-8
Online ISBN: 978-3-642-40846-5
eBook Packages: Computer ScienceComputer Science (R0)