The DOI matches its Crossref record; 88 of the 88 references it cites were found in a registry or an index.
State-of-the-art in privacy preserving data mining
Abstract
We provide here an overview of the new and rapidly emerging research area of privacy preserving data mining. We also propose a classification hierarchy that sets the basis for analyzing the work which has been performed in this context. A detailed review of the work accomplished in this area is also given, along with the coordinates of each work to the classification hierarchy. A brief evaluation is performed, and some initial conclusions are made.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
(1992) · Cited by 23,431
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
(1996) · Cited by 20,179
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
The Mathematical Theory of Communication
Shannon, C. E., Weaver, W., & Wiener, N. (1950) · Physics Today · doi:10.1063/1.3067010 · Cited by 9,801
Rough Sets: Theoretical Aspects of Reasoning about Data
Pawlak, Z. (1991) · Our Digital Library (Warsaw University of Technology) · Cited by 8,343
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Beyond Accuracy: What Data Quality Means to Data Consumers
Wang, R. Y., & Strong, D. M. (1996) · Journal of Management Information Systems · doi:10.1080/07421222.1996.11518099 · Cited by 4,672
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
Validity of the single processor approach to achieving large scale computing capabilities
Amdahl, G. M. (1967) · Proceedings of the April 18-20, 1967, spring joint computer conference on - AFIPS '67 (Spring) · doi:10.1145/1465482.1465560 · Cited by 4,339
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
The Cascade-Correlation learning architecture
Fahlman, S. E., & Lebiere, C. J. (2018) · doi:10.1184/r1/6610403 · Cited by 2,372
Data mining: an overview from a database perspective
Chen, M.-S., Han, J., & Yu, P. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553155 · Cited by 2,232
Chameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
Mixture models : inference and applications to clustering
McLachlan, G. J., & Basford, K. E. (1988) · M. Dekker eBooks · Cited by 2,094
ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s021848850200165x · Cited by 1,976
Dynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
Knowledge Discovery in Databases
Piateski, G., & Frawley, W. (1991) · The MIT Press eBooks · Cited by 1,749
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
van Gelder, H. A. E. (1961) · The Two Reformations in the 16th Century · doi:10.1007/978-94-011-9562-1_10 · Cited by 1,652
Mining generalized association rules
Srikant, R., & Agrawal, R. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00019-8 · Cited by 1,618
An Efficient Algorithm for Mining Association Rules in Large Databases
Savasere, A., Omiecinski, E. R., & Navathe, S. B. (1995) · Cited by 1,590
Anchoring Data Quality Dimensions in Ontological Foundations
Wand, Y., & Wang, R. Y. (1996) · Communications of the ACM · doi:10.1145/240455.240479 · Cited by 1,479
Rock: A robust clustering algorithm for categorical attributes
Guha, S., Rastogi, R., & Shim, K. (2000) · Information Systems · doi:10.1016/s0306-4379(00)00022-3 · Cited by 1,472
An effective hash-based algorithm for mining association rules
Park, J. S., Chen, M.-S., & Yu, P. S. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223813 · Cited by 1,406
SLINK: An optimally efficient algorithm for the single-link cluster method
Sibson, R. (1973) · The Computer Journal · doi:10.1093/comjnl/16.1.30 · Cited by 1,203
An efficient approach to clustering in large multimedia databases with noise
Hinneburg, A., & Keim, D. A. (1998) · KOPS (University of Konstanz) · Cited by 1,181
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
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
Discovery, Analysis, and Presentation of Strong Rules
Piatetsky-Shapiro, G. (1991) · Medical Entomology and Zoology · Cited by 993
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
Privacy-preserving distributed mining of association rules on horizontally partitioned data
Clifton, C., Kantarcioglu, M., Clifton, C., & Member, S. (2010) · Cited by 908
Parallelism in random access machines
Fortune, S., & Wyllie, J. (1978) · Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 · doi:10.1145/800133.804339 · Cited by 891
Tools for privacy preserving distributed data mining
Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., & Zhu, M. Y. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772867 · Cited by 890
Proceedings of the 27th International Conference on Very Large Data Bases
Apers, P. M. G., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., & Snodgrass, R. T. (2001) · Cited by 845
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
The EM algorithm for graphical association models with missing data
Lauritzen, S. L. (1995) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(93)e0056-a · Cited by 760
An efficient algorithm for a complete link method
Defays, D. (1977) · The Computer Journal · doi:10.1093/comjnl/20.4.364 · Cited by 752
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
Ertöz, L., Steinbach, M., & Kumar, V. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.5 · Cited by 703
Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier.
Domingos, P., & Pazzani, M. J. (1996) · Cited by 690
Privacy Preserving Data Mining
Lindell, & Pinkas (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0019-2 · Cited by 668
Elements of Statistical Disclosure Control
Willenborg, L., & de Waal, T. (2001) · Lecture Notes in Statistics · doi:10.1007/978-1-4613-0121-9 · Cited by 649
Modeling Data and Process Quality in Multi-Input, Multi-Output Information Systems
Ballou, D. P., & Pazer, H. L. (1985) · Management Science · doi:10.1287/mnsc.31.2.150 · Cited by 545
Verykios, V. S., Elmagarmid, A. K., Bertino, E., Saygin, Y., & Dasseni, E. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.1269668 · Cited by 518
Self-citationMaintaining 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
Secure multi-party computation problems and their applications: a review and open problems
Du, W., & Atallah, M. J. (2001) · Proceedings of the 2001 workshop on New security paradigms · doi:10.1145/508171.508174 · Cited by 453
Speedup versus efficiency in parallel systems
Eager, D. L., Zahorjan, J., & Lazowska, E. D. (1989) · IEEE Transactions on Computers · doi:10.1109/12.21127 · Cited by 437
A fast distributed algorithm for mining association rules
Cheung, D. W., Han, J., Ng, V. T., Fu, A. W., & Fu, Y. (2002) · Fourth International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568665 · Cited by 432
Tayi, G. K., & Ballou, D. P. (1998) · Communications of the ACM · doi:10.1145/269012.269021 · Cited by 428
Disclosure limitation of sensitive rules
Atallah, M. J., Bertino, E., Elmagarmid, A. K., Ibrahim, M., & Verykios, V. S. (2003) · doi:10.1109/kdex.1999.836532 · Cited by 426
Self-citationPhilosophical Dimensions of Privacy: An Anthology
(1984) · doi:10.1017/cbo9780511625138 · Cited by 416
Building decision tree classifier on private data
Du, W. K., & Zhan, Z. (2002) · Syracuse University Libraries (Syracuse University) · Cited by 382
An information theoretic approach to rule induction from databases
Smyth, P., & Goodman, R. M. (1992) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.149926 · Cited by 356
Privacy-Preserving Datamining on Vertically Partitioned Databases
Dwork, C., & Nissim, K. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_32 · Cited by 348
Using unknowns to prevent discovery of association rules
Saygin, Y., Verykios, V. S., & Clifton, C. (2001) · ACM SIGMOD Record · doi:10.1145/604264.604271 · Cited by 338
Self-citationHiding Association Rules by Using Confidence and Support
Dasseni, E., Verykios, V. S., Elmagarmid, A. K., & Bertino, E. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45496-9_27 · Cited by 308
Self-citationPrivacy Preserving Frequent Itemset Mining
Oliveira, S. R. D. M., & Zai͏̈ane, O. R. (n.d.) · Cited by 306
SECURITY AND PRIVACY IMPLICATIONS OF DATA MINING
Clifton, C., & Marks, D. G. (1996) · Cited by 271
Suppression Methodology and Statistical Disclosure Control
Cox, L. H. (1980) · Journal of the American Statistical Association · doi:10.1080/01621459.1980.10477481 · Cited by 271
Privacy preserving association rule mining
Saygin, Y., Verykios, V. S., & Elmagarmid, A. K. (2003) · Proceedings Twelfth International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems RIDE-2EC 2002 · doi:10.1109/ride.2002.995109 · Cited by 241
Self-citationPUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
Rastogi, R., & Shim, K. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009887311454 · Cited by 216
Secure statistical databases with random sample queries
Denning, D. E. (1980) · ACM Transactions on Database Systems · doi:10.1145/320613.320616 · Cited by 204
Kent, W. (1978) · Cited by 203
Statistical Databases: Characteristics, Problems, and some Solutions
Shoshani, A. (1982) · Very Large Data Bases · Cited by 201
Auditing and Inference Control in Statistical Databases
Chin, F. Y., & Ozsoyoglu, G. (1982) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1982.236161 · Cited by 189
MDL-based decision tree pruning
Mehta, M., Rissanen, J., & Agrawal, R. (1995) · Cited by 187
A Framework for Evaluating Privacy Preserving Data Mining Algorithms*
Bertino, E., Fovino, I. N., & Provenza, L. P. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0006-6 · Cited by 174
Self-citationResnikoff, H. L. (1989) · Springer eBooks · doi:10.1007/978-1-4612-3474-6 · Cited by 168
Randomization in privacy preserving data mining
Evfimievski, A. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772869 · Cited by 164
Local learning in probabilistic networks with hidden variables
Russell, S., Binder, J., Koller, D., et al. (1995) · Cited by 141
Data as a Resource: Properties, Implications, and Prescriptions
Levitin, A. (1998) · Sloan management review · Cited by 127
A secure protocol for computing dot-products in clustered and distributed environments
Ioannidis, I., Grama, A. Y., & Atallah, M. J. (2003) · Proceedings of the International Conference on Parallel Processing · doi:10.1109/icpp.2002.1040894 · Cited by 117
Knowledge Discovery as a Threat to Database Security.
O’Leary, D. E. (1991) · Cited by 105
Chin, F. Y. L., & Özsoyoğlu, G. (1981) · ACM Transactions on Database Systems · doi:10.1145/319540.319558 · Cited by 79
Information Driven Evaluation of Data Hiding Algorithms
Bertino, E., & Fovino, I. N. (2005) · Lecture notes in computer science · doi:10.1007/11546849_41 · Cited by 20
Self-citationPreface: proceedings of the ICDM 2002 workshop on privacy, security, and data mining
Estivill‐Castro, V., & Clifton, C. (2002) · Cited by 3
Cited by
Chen, M., Mao, S., & Liu, Y. (2014) · Mobile Networks and Applications · doi:10.1007/s11036-013-0489-0 · Cited by 2,913
Ikotun, A. M., Ezugwu, A. E., Abualigah, L., Abuhaija, B., & Heming, J. (2023) · Information Sciences · doi:10.1016/j.ins.2022.11.139 · Cited by 2,272
Privacy preserving crowd monitoring: Counting people without people models or tracking
Chan, A. B., Liang, Z.-S. J., & Vasconcelos, N. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587569 · Cited by 1,172
Toward Scalable Systems for Big Data Analytics: A Technology Tutorial
Hu, H., Wen, Y., Chua, T.-S., & Li, X. (2014) · IEEE Access · doi:10.1109/access.2014.2332453 · Cited by 1,099
Information Security in Big Data: Privacy and Data Mining
Xu, L., Jiang, C., Wang, J., Yuan, J., & Ren, Y. (2014) · IEEE Access · doi:10.1109/access.2014.2362522 · Cited by 631
Metadata
- Authors
- Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y.
- Venue
- ACM SIGMOD Record
- Published
- 2004-03
- Volume
- 33
- Issue
- 1
- Pages
- 50-57
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2145747124
- Cited by
- 816
- References
- 88
- FWCI
- 45.07
- Type
- journal article
- 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.