The DOI matches its Crossref record.
A data distortion by probability distribution
Open accessAbstract
This paper introduces data distortion by probability distribution, a probability distortion that involves three steps. The first step is to identify the underlying density function of the original series and to estimate the parameters of this density function. The second step is to generate a series of data from the estimated density function. And the final step is to map and replace the generated series for the original one. Because it is replaced by the distorted data set, probability distortion guards the privacy of an individual belonging to the original data set. At the same time, the probability distorted series provides asymptotically the same statistical properties as those of the original series, since both are under the same distribution. Unlike conventional point distortion, probability distortion is difficult to compromise by repeated queries, and provides a maximum exposure for statistical analysis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
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
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
Revealing information while preserving privacy
Dinur, I., & Nissim, K. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773173 · Cited by 980
Security-control methods for statistical databases: a comparative study
Adam, N. R., & Worthmann, J. C. (1989) · ACM Computing Surveys · doi:10.1145/76894.76895 · Cited by 969
Agrawal, R., Kiernan, J., Srikant, R., & Xu, Y. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50021-4 · Cited by 723
Liu, K., Kargupta, H., & Ryan, J. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.14 · Cited by 554
Enhancing Source-Location Privacy in Sensor Network Routing
Kamat, P., Zhang, Y., Trappe, W., & Ozturk, C. (2005) · 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05) · doi:10.1109/icdcs.2005.31 · Cited by 530
A 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
A Condensation Approach to Privacy Preserving Data Mining
Aggarwal, C. C., & Yu, P. S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24741-8_12 · Cited by 364
Efficient k-Anonymization Using Clustering Techniques
Byun, J.-W., Kamra, A., Bertino, E., & Li, N. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71703-4_18 · Cited by 329
Min Max Normalization Based Data Perturbation Method for Privacy Protection
JAIN, Y. K., & BHANDARE, S. K. (2013) · International Journal of Computer and Communication Technology · doi:10.47893/ijcct.2013.1201 · Cited by 297
Metadata
- Authors
- Liew, C. K., Choi, U. J., & Liew, C. J.
- Venue
- ACM Transactions on Database Systems
- Published
- 1985-09
- Volume
- 10
- Issue
- 3
- Pages
- 395-411
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W1981961329
- Cited by
- 202
- References
- 0
- FWCI
- 0.85
- Type
- journal article
- Language
- en
- Open access
- bronze
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.