The Community for Technology Leaders
Green Image
Issue No. 01 - January (2012 vol. 61)
ISSN: 0018-9340
pp: 101-117
Yingpeng Sang , University of Adelaide, Adelaide
Hong Shen , University of Adelaide, Adelaide
Hui Tian , Beijing Jiaotong University, Beijing
Random Projection (RP) has raised great concern among the research community of privacy-preserving data mining, due to its high efficiency and utility, e.g., keeping the euclidean distances among the data points. It was shown in [33] that, if the original data set composed of m attributes is multiplied by a mixing matrix of k\times m (m>k) which is random and orthogonal on expectation, then the k series of perturbed data can be released for mining purposes. Given the data perturbed by RP and some necessary prior knowledge, to our knowledge, little work has been done in reconstructing the original data to recover some sensitive information. In this paper, we choose several typical scenarios in data mining with different assumptions on prior knowledge. For the cases that an attacker has full or zero knowledge of the mixing matrix R, respectively, we propose reconstruction methods based on Underdetermined Independent Component Analysis (UICA) if the attributes of the original data are mutually independent and sparse, and propose reconstruction methods based on Maximum A Posteriori (MAP) if the attributes of the original data are correlated and nonsparse. Simulation results show that our reconstructions achieve high recovery rates, and outperform the reconstructions based on Principal Component Analysis (PCA). Successful reconstructions essentially mean the leakage of privacy, so our work identify the possible risks of RP when it is used for data perturbations.
Privacy-preserving data mining, data perturbation, data reconstruction, underdetermined independent component analysis, Maximum A Posteriori, principal component analysis.

H. Tian, Y. Sang and H. Shen, "Effective Reconstruction of Data Perturbed by Random Projections," in IEEE Transactions on Computers, vol. 61, no. , pp. 101-117, 2011.
89 ms
(Ver 3.3 (11022016))