The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
On the privacy preserving properties of random data perturbation techniques
Abstract
Privacy is becoming an increasingly important issue in many data mining applications. This has triggered the development of many privacy-preserving data mining techniques. A large fraction of them use randomized data distortion techniques to mask the data for preserving the privacy of sensitive data. This methodology attempts to hide the sensitive data by randomly modifying the data values often using additive noise. We question the utility of the random value distortion technique in privacy preservation. We note that random objects (particularly random matrices) have "predictable" structures in the spectral domain and it develops a random matrix-based spectral filtering technique to retrieve original data from the dataset distorted by adding random values. We present the theoretical foundation of this filtering method and extensive experimental results to demonstrate that in many cases random data distortion preserve very little data privacy. We also point out possible avenues for the development of new privacy-preserving data mining techniques like exploiting multiplicative and colored noise for preserving privacy in data mining applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Łuczak, T., Janson, S., & Ruciński, A. (2000) · Cited by 2,192
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
Janson, S., Łuczak, T., & Rucinski, A. (2000) · Wiley eBooks · doi:10.1002/9781118032718 · Cited by 1,545
On the design and quantification of privacy preserving data mining algorithms
Agrawal, D., & Aggarwal, C. C. (2001) · Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/375551.375602 · Cited by 1,006
Privacy preserving association rule mining in vertically partitioned data
Vaidya, J., & Clifton, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775142 · Cited by 1,001
Privacy-preserving distributed mining of association rules on horizontally partitioned data
Clifton, C., Kantarcioglu, M., Clifton, C., & Member, S. (2010) · Cited by 908
Limiting privacy breaches in privacy preserving data mining
Evfimievski, A., Gehrke, J., & Srikant, R. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773174 · Cited by 815
Privacy preserving mining of association rules
Evfimievski, A., Srikant, R., Agrawal, R., & Gehrke, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775080 · Cited by 768
Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
Stewart, G. W. (1973) · SIAM Review · doi:10.1137/1015095 · Cited by 609
Statisical and Adaptive Signal Processing
Ingle, V. K., Kogon, S. M., & Manolakis, D. G. (2005) · Cited by 512
Maintaining Data Privacy in Association Rule Mining
Rizvi, S. J., & Haritsa, J. R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50066-4 · Cited by 485
Inequalities between the Two Kinds of Eigenvalues of a Linear Transformation
Weyl, H. (1949) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.35.7.408 · Cited by 372
Some limit theorems for the eigenvalues of a sample covariance matrix
Jonsson, D. (1982) · Journal of Multivariate Analysis · doi:10.1016/0047-259x(82)90080-x · Cited by 371
Privacy-preserving distributed mining of association rules on horizontally partitioned data
Kantarcıoğlu, M., & Clifton, C. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.45 · Cited by 262
Privacy preserving mining of association rules
Evfimievski, A., Srikant, R., Agrawal, R., & Gehrke, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '02 · doi:10.1145/775079.775080 · Cited by 198
The statistical security of a statistical database
Traub, J. F., Yemini, Y., & Woźniakowski, H. (1984) · ACM Transactions on Database Systems · doi:10.1145/1994.383392 · Cited by 167
Randomization in privacy preserving data mining
Evfimievski, A. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772869 · Cited by 164
Data Swapping: Balancing Privacy against Precision in Mining for Logic Rules
Estivill‐Castro, V., & Branković, L. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48298-9_41 · Cited by 108
Cited by
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704
Liu, K., Kargupta, H., & Ryan, J. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.14 · Cited by 554
Self-citationA General Survey of Privacy-Preserving Data Mining Models and Algorithms
Aggarwal, C. C., & Yu, P. S. (2008) · Advances in Database Systems · doi:10.1007/978-0-387-70992-5_2 · Cited by 469
Metadata
- Authors
- Kargupta, H., Datta, S., Wang, Q., & Sivakumar, K.
- Venue
- Third IEEE International Conference on Data Mining
- Publisher
- IEEE Comput. Soc
- Published
- 2004-04-23
- Pages
- 99-106
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2164341199
- Cited by
- 618
- References
- 19
- FWCI
- 22.55
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.