DBScholar

Back to papers

On the Design and Quantification of Privacy Preserving Data Mining Algorithms

Summary: EM-based distribution reconstruction that provably converges to the MLE from perturbed data, improving estimation accuracy and robustness with large samples. Defines quantitative privacy metrics to measure reconstruction loss and compare perturbation mechanisms, providing a foundation for evaluating privacy-preserving data mining. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
hde7f7ba22f996313
Venue
PODS
Year
2001
Pagerank
0.00023020039
Overall Rank
254 | 98.30%
DOI
10.1145/375551.375602

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{agrawal_pods01,
        address = {New York, NY, USA},
        series = {{PODS} '01},
        title = {{On the Design and Quantification of Privacy Preserving Data Mining Algorithms}},
        url = {https://dl.acm.org/doi/10.1145/375551.375602},
        doi = {10.1145/375551.375602},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Agrawal, Dakshi and Aggarwal, Charu C.},
        year = {2001}
}

Incoming Citations (Sorted by Pagerank)

Showing 22 of 22 citing papers.

Rank Citing Paper Year Venue Pagerank
122 Revealing Information while Preserving Privacy 2003 PODS 0.00030770793
133 Privacy, Accuracy, and Consistency Too: A Holistic Solution to Contingency Table Release 2007 PODS 0.0003006035
226 Limiting Privacy Breaches in Privacy Preserving Data Mining 2003 PODS 0.00023984903
404 On the Complexity of Optimal K-Anonymity 2004 PODS 0.00019081867
520 Practical Privacy: The SuLQ Framework 2005 PODS 0.00016939312
1,097 Privacy Preserving OLAP 2005 SIGMOD 0.00012041002
1,331 A Privacy-Preserving Index for Range Queries 2004 VLDB 0.00010999239
1,705 Injecting Utility into Anonymized Datasets 2006 SIGMOD 9.831451e-05
1,869 On k-Anonymity and the Curse of Dimensionality 2005 VLDB 9.4714801e-05
2,165 Data Synthesis based on Generative Adversarial Networks 2018 VLDB 8.933677e-05
2,175 Two Can Keep a Secret: A Distributed Architecture for Secure Database Services 2005 CIDR 8.9159708e-05
4,329 Relational Data Synthesis using Generative Adversarial Networks: A Design Space Exploration 2020 VLDB 6.6597797e-05
4,651 Deriving Private Information from Randomized Data 2005 SIGMOD 6.4857639e-05
4,662 Time Series Compressibility and Privacy 2007 VLDB 6.4812985e-05
5,209 SAM: Database Generation from Query Workloads with Supervised Autoregressive Models 2022 SIGMOD 6.2262056e-05
6,704 Distance-Sensitive Hashing 2018 PODS 5.7051402e-05
8,041 Privacy-Enhancing k-Anonymization of Customer Data 2005 PODS 5.4015242e-05
8,568 Information Theory for Data Management 2010 SIGMOD 5.3134519e-05
8,826 Privacy-MaxEnt: Integrating Background Knowledge in Privacy Quantification 2008 SIGMOD 5.268646e-05
8,827 To Do or Not To Do: The Dilemma of Disclosing Anonymized Data 2005 SIGMOD 5.268646e-05
12,838 Information Theory For Data Management 2009 VLDB 4.9793485e-05
13,099 Privacy in Data Systems 2003 PODS 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
68 Privacy-Preserving Data Mining 2000 SIGMOD 0.00037958605
Previous Page 1 / 1 Next

Semantically Similar Papers