A Survey on k-NN Classification over Semantically Secure Encrypted Relational

Mayadevi Kotlapure

Abstract: Data Mining has wide applications in numerous zones, for example, keeping money, prescription, investigative exploration and among government offices. Order is one of the ordinarily utilized assignments as a part of information mining applications. For as far back as decade, due to the ascent of different protection issues, numerous hypothetical and commonsense answers for the order issue have been proposed under diverse security models. Notwithstanding, with the late fame of distributed computing, clients now have the chance to outsource their information, in encoded structure, and also the information mining assignments to the cloud. Since the information on the cloud is in encoded structure, existing security protecting characterization methods are not appropriate. In this paper, we concentrate on fathoming the characterization issue over encoded information. Specifically, we propose a safe k-NN classifier over scrambled information in the cloud. The proposed convention ensures the classification of information, security of client's data inquiry, and shrouds the information access designs. To the best of our learning, our work is the first to add to a safe k-NN classifier over scrambled information under the semi-legitimate model. Additionally, we exactly dissect the effectiveness of our proposed convention utilizing a genuine dataset under diverse parameter settings.

Keywords: Security, k-NN Classifier, Outsourced Databases,

How to Cite?: Mayadevi Kotlapure, "A Survey on k-NN Classification over Semantically Secure Encrypted Relational", Volume 4 Issue 11, November 2015, International Journal of Science and Research (IJSR), Pages: 2258-2261, https://www.ijsr.net/getabstract.php?paperid=NOV151726, DOI: https://dx.doi.org/10.21275/NOV151726

Download Citation: APA | MLA | BibTeX | EndNote | RefMan