Privacy Preserving K-nearest Neighbor Classification
نویسندگان
چکیده
This paper considers how to conduct k-nearest neighbor classification in the following scenario: multiple parties, each having a private data set, want to collaboratively build a k-nearest neighbor classifier without disclosing their private data to each other or any other parties. Specifically, the data are vertically partitioned in that all parties have data about all the instances involved, but each party has its own view of the instances each party works with its own attribute set. Because of privacy constraints, developing a secure framework to achieve such a computation is both challenging and desirable. In this paper, we develop a secure protocol for multiple parties to conduct the desired computation. All the parties participate in the encryption and in the computation involved in learning the k-nearest neighbor classifiers.
منابع مشابه
T Evaluating the Classification Accuracy of Data Mining Algorithms for Anonymized Data
Recent advances in hardware technology have increased storage and recording capability with regard to personal data on individuals. This has created fears that such data could be misused. To alleviate such concerns, data was anonymized and many techniques were recently proposed on performing data mining tasks in ways which ensured privacy. Anonymization techniques were drawn from a variety of r...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملHEMIN: A Cryptographic Approach for Private k-NN Classification
Data mining is frequently obstructed by privacy concerns. In many cases, data is shared with third party for the mining purpose. However, sharing of data for analysis is not possible due to prevailing privacy laws and/or policies. Privacy preserving data mining techniques have been developed to address this issue by providing mechanisms to mine the data while guaranteing certain levels of priva...
متن کاملA k-Nearest Neighbor Search Algorithm for Enhancing Data Privacy in Outsourced Spatial Databases
With the advancement of cloud computing technologies and the propagation of locationbased services, research on outsourced spatial databases has been spotlighted. Therefore, the traditional spatial databases owners want to outsource their resources to a service provider so that they can reduce cost for storage and management. However, the issue of privacy preservation is crucial in spatial data...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Network Security
دوره 1 شماره
صفحات -
تاریخ انتشار 2005