Abstract
Data privacy preservation has become one of the major concerns in the design of practical data-mining applications. In this paper, a novel data distortion approach based on structural partition and Sparsified Singular Value Decomposition (SSVD) technique is proposed. Three schemes are designed to balance privacy protection in centralised datasets and mining accuracy. Some metrics are used to evaluate the performance of the proposed new strategies. Data utility of the three proposed schemes is examined by a binary classification based on the support vector machine. Furthermore, we examine three sparsification strategies. The effect of method parameters on data distortion level and utility is also studied experimentally. Our experimental results on synthetic and real datasets indicate that, in comparison with standard data distortion techniques, the proposed schemes are efficient in balancing data distortion level and data utility. They afford a feasible solution with a good promise for mining accuracy and a significant reduction in the computational cost from SVD.
Original language | English |
---|---|
Pages (from-to) | 48-70 |
Number of pages | 23 |
Journal | International Journal of Information and Computer Security |
Volume | 2 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2008 |
Keywords
- Data mining
- Information and computer security
- Matrix partition
- Privacy protection
- SSVD
- Security
- Sparsification
- Sparsified singular value decomposition
ASJC Scopus subject areas
- Software
- Safety, Risk, Reliability and Quality
- Hardware and Architecture
- Computer Networks and Communications