Privacy Preserving Clustering In Data Mining

Sinha, B K and Kumar, J (2010) Privacy Preserving Clustering In Data Mining. BTech thesis.

[img]
Preview
PDF
491Kb

Abstract

Huge volume of detailed personal data is regularly collected and sharing of these data is proved to be beneficial for data mining application. Such data include shopping habits, criminal records, medical history, credit records etc .On one hand such data is an important asset to business organization and governments for decision making by analyzing it .On the other hand privacy regulations and other privacy concerns may prevent data owners from sharing information for data analysis. In order to share data while preserving privacy data owner must come up with a solution which achieves the dual goal of privacy preservation as well as accurate clustering result. Trying to give solution for this we implemented vector quantization approach piecewise on the datasets which segmentize each row of datasets and quantization approach is performed on each segment using K means which later are again united to form a transformed data set. Some experimental results are presented which tries to finds the optimum value of segment size and quantization parameter which gives optimum in the tradeoff between clustering utility and data privacy in the input dataset.

Item Type:Thesis (BTech)
Uncontrolled Keywords:Privacy Preserving Clustering
Subjects:Engineering and Technology > Computer and Information Science > Data Mining
Divisions: Engineering and Technology > Department of Computer Science
ID Code:1789
Deposited By:Binit Sinha
Deposited On:14 May 2010 15:55
Last Modified:14 May 2010 15:55
Related URLs:
Supervisor(s):Jena, S K

Repository Staff Only: item control page