DocumentCode
1879575
Title
Data perturbation and feature selection in preserving privacy
Author
Jahan, Thanveer ; Narsimha, G. ; Rao, C. V Guru
Author_Institution
JNTU, Hyderabad, India
fYear
2012
fDate
20-22 Sept. 2012
Firstpage
1
Lastpage
6
Abstract
Privacy Preserving plays a vital role; in designing various security-related data mining applications. Protecting sensitive information in data mining has become an important issue. Data distortion or data perturbation is a critical component, widely used to protect sensitive data. Many approaches try to preserve privacy by adding noise or by matrix decomposition methods. In this paper we propose data distortion methods such as singular value decomposition (SVD) and sparsified singular value decomposition (SSVD) technique along with feature selection to reduce feature space. Various privacy metrics have been proposed to measure the difference between original dataset and distorted dataset and degree of privacy protection. Our experimental results use a real world dataset. It shows a feasible solution using sparsified singular value decomposition along with a feature selection, which could better preserve privacy. Extracting accurate information from datasets will make reasonable decisions using data mining algorithms. The mining utility on perturbed data is tested with a well known classifiers such as SVM, ID3 and C4.5.
Keywords
data mining; data privacy; singular value decomposition; support vector machines; C4.5; ID3; SSVD; SVM; data distortion; data perturbation; feature selection; matrix decomposition methods; privacy preservation; security-related data mining applications; sparsified singular value decomposition; C4.5; Feature selection; ID3; Perturbation; SSVD; SVD; SVM;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless and Optical Communications Networks (WOCN), 2012 Ninth International Conference on
Conference_Location
Indore
ISSN
2151-7681
Print_ISBN
978-1-4673-1988-1
Type
conf
DOI
10.1109/WOCN.2012.6335531
Filename
6335531
Link To Document