Privacy-Preserving K-NN Classification Using Vector Operations

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a privacy-preserving K-nearest neighbor (PPKNN) classification algorithm in privacy-preserving data mining (PPDM) domain to preserve privacy of customers in business organization. This paper is about modification of K-nearest neighbor (K-NN) classification algorithm using vector operations. It modifies each cell of the original data record by dividing into three sub-components as a single unit row vector. Similarly, the test data record is converted into cells of column unit vectors. Finally, the dot product is applied between row and column vectors to preserve the distance between the data records as original data records. In modified dataset when distances between the records are preserved, then PPKNN works similar to K-NN algorithm. In this work, PPKNN is applied on real datasets referred from UCI machine learning repository and compares classification accuracies with K-NN algorithm.

Cite

CITATION STYLE

APA

Jalla, H., & Girija, P. N. (2019). Privacy-Preserving K-NN Classification Using Vector Operations. In Lecture Notes in Networks and Systems (Vol. 40, pp. 655–664). Springer. https://doi.org/10.1007/978-981-13-0586-3_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free