Effective reconstruction of data perturbed by random projections

Simple item page
dc.contributor.authorSang, Y.
dc.contributor.authorShen, H.
dc.contributor.authorTian, H.
dc.date.issued2012
dc.description.abstractRandom 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 ktimes 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.
dc.description.statementofresponsibilityYingpeng Sang, Hong Shen, and Hui Tian
dc.identifier.citationIEEE transactions on computers, 2012; 61(1):101-117
dc.identifier.doi10.1109/TC.2011.83
dc.identifier.issn0018-9340
dc.identifier.issn1557-9956
dc.identifier.orcidShen, H. [0000-0002-3663-6591] [0000-0003-0649-0648]
dc.identifier.urihttp://hdl.handle.net/2440/69831
dc.language.isoen
dc.publisherIEEE Computer Soc
dc.relation.granthttp://purl.org/au-research/grants/arc/DP0985063
dc.rights© 2012 IEEE
dc.source.urihttps://doi.org/10.1109/tc.2011.83
dc.subjectPrivacy-preserving data mining
dc.subjectdata perturbation
dc.subjectdata reconstruction
dc.subjectunderdetermined independent component analysis
dc.subjectMaximum A Posteriori
dc.subjectprincipal component analysis.
dc.titleEffective reconstruction of data perturbed by random projections
dc.typeJournal article
pubs.publication-statusPublished

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
RA_hdl_69831.pdf
Size:
880.65 KB
Format:
Adobe Portable Document Format
Description:
Restricted Access
Download

Collections

Computer Science publications