Article

Mining multiple private databases using a kNN classifier

Authors:

Subramanyam Chitti,

Ling LiuAuthors Info & Claims

SAC '07: Proceedings of the 2007 ACM symposium on Applied computing

Pages 435 - 440

https://doi.org/10.1145/1244002.1244102

Published: 11 March 2007 Publication History

Abstract

Modern electronic communication has collapsed geographical boundaries for global information sharing but often at the expense of data security and privacy boundaries. Distributed privacy preserving data mining tools are increasingly becoming critical for mining multiple databases with a minimum information disclosure. We present a framework including a general model as well as multi-round algorithms for mining horizontally partitioned databases using a privacy preserving k Nearest Neighbor (kNN) classifier. A salient feature of our approach is that it offers a trade-off between accuracy, efficiency and privacy through multi-round protocols.

References

[1]

G. Aggarwal, N. Mishra, and B. Pinkas. Secure computation of the kth ranked element. In IACR Conference on Eurocrypt, 2004.

[2]

R. Agrawal, P. Bird, T. Grandison, J. Kieman, S. Logan, and W. Rjaibi. Extending relational database systems to automatically enforce privacy policies. In ICDE, 2005.

Digital Library

[3]

R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In ACM SIGMOD Conference, 2003.

Digital Library

[4]

R. Agrawal, J. Kieman, R. Srikant, and Y. Xu. Hippocratic databases. In International Conference on Very Large Databases (VLDB), 2002.

Digital Library

[5]

E. Bertino, B. Ooi, Y. Yang, and R. H. Deng. Privacy and ownership preserving of outsourced medical data. In ICDE, 2005.

Digital Library

[6]

C. Clifton. Tutorial on privacy, security, and data mining. In 13th European Conference on Machine Learning and 6th European Conference on Principles and Practice of Knowledge Discovery in Databases, 2002.

[7]

C. Clifton, M. Kantarcioglu, X. Lin, J. Vaidya, and M. Zhu. Tools for privacy preserving distributed data mining. In SIGKDD Explorations, 2003.

Digital Library

[8]

J. Gehrke. Models and methods for privacy-preserving data analysis and publishing. In ICDE, 2006.

Digital Library

[9]

B. German. In ftp://ftp.ics.uci.edu/pub/machine-learning-databases/glass.

[10]

O. Goldreich. Secure multi-party computation, 2001. Working Draft, Version 1.3.

[11]

S. Goldwasser. Multi-party computations: past and present. In ACM Symposium on Principles of Distributed Computing (PODC), 1997.

Digital Library

[12]

H. Hacigumus, B. Iyer, C. Li, and S. Mehrotra. Executing sql over encrypted data in the database service provider model. In ACM SIGMOD Conference, 2002.

Digital Library

[13]

B. Hore, S. Mehrotra, and G. Tsudik. A privacy-preserving index for range queries. In ACM Symposium on Principles of Distributed Computing (PODC), 1997.

Digital Library

[14]

V. S. Iyengar. Transforming data to satisfy privacy constraints. In SIGKDD, 2002.

Digital Library

[15]

S. Jajodia and R. Sandhu. Toward a multilevel secure relational data model. In ACM SIGMOD Conference, 1991.

Digital Library

[16]

M. Kantarcioglu and C. Clifton. Privacy preserving data mining of association rules on horizontally partitioned data. IEEE Transactions on Knowledge and Data Engineering (TKDE), 16(9), 2004.

Digital Library

[17]

M. Kantarcioglu and C. Clifton. Privacy preserving k-nn classifier. In ICDE, 2005.

[18]

M. Kantarcoglu and J. Vaidya. Privacy preserving naive bayes classifier for horizontally partitioned data. In IEEE ICDM Workshop on Privacy Preserving Data Mining, 2003.

[19]

K. LeFevre, D. DeWitt, and R. Ramakrishnan. Workload-aware anonymization. In SIGKDD, 2006.

Digital Library

[20]

Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3), 2002.

Digital Library

[21]

V. Sigillito. Pima. In ftp://ftp.ics.uci.edu/pub/machine-learning-databases/pima-indians-diabetes.

[22]

J. Vaidya and C. Clifton. Privacy preserving association rule mining in vertically partitioned data. In SIGKDD, 2002.

Digital Library

[23]

J. vaidya and C. Clifton. Privacy-preserving k-means clustering over vertically partitioned data. In SIGKDD, 2003.

Digital Library

[24]

J. Vaidya and C. Clifton. Privacy preserving naive bayes classifier for vertically partitioned data. In SIGKDD, 2003.

Digital Library

[25]

J. Vaidya and C. Clifton. Privacy-preserving top-k queries. In ICDE, 2005.

Digital Library

[26]

V. S. Verykios, E. Bertino, I. N. Fovino, L. P. Provenza, Y. Saygin, and Y. Theodoridis. State-of-the-art in privacy preserving data mining. ACM SIGMOD Record, 33(1), 2004.

Digital Library

[27]

K. Wang, B. C. M. Fung, and G. Dong. Integrating private databases for data analysis. In IEEE ISI, 2005.

Digital Library

[28]

S. Waugh. In ftp://ftp.ics.uci.edu/pub/machine-learning-databases/abalone.

[29]

L. Xiong, S. Chitti, and L. Liu. Topk queries across multiple private databases. In 25th International Conference on Distributed Computing Systems (ICDCS), 2005.

Digital Library

[30]

Z. Yang, S. Zhong, and R. N. Wright. Privacy-preserving classification of customer data without loss of accuracy. In SIAM SDM, 2005.

Cited By

Al-Eiadeh MQaddoura RAbdallah M(2024)Investigating the Performance of a Novel Modified Binary Black Hole Optimization Algorithm for Enhancing Feature SelectionApplied Sciences10.3390/app1412520714:12(5207)Online publication date: 14-Jun-2024
https://doi.org/10.3390/app14125207
Zerka FBarakat SWalsh SBogowicz MLeijenaar RJochems AMiraglio BTownend DLambin P(2020)Systematic Review of Privacy-Preserving Distributed Machine Learning From Federated Databases in Health CareJCO Clinical Cancer Informatics10.1200/CCI.19.00047(184-200)Online publication date: Nov-2020
https://doi.org/10.1200/CCI.19.00047
Park JLee D(2020)Parallelly Running k-Nearest Neighbor Classification Over Semantically Secure Encrypted Data in Outsourced EnvironmentsIEEE Access10.1109/ACCESS.2020.29845798(64617-64633)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2984579
Show More Cited By

Index Terms

Mining multiple private databases using a kNN classifier
1. Information systems
  1. Information systems applications

Recommendations

k nearest neighbor classification across multiple private databases
CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management

Distributed privacy preserving data mining tools are critical for mining multiple databases with a minimum information disclosure. We present a framework including a general model as well as multi-round algorithms for mining horizontally partitioned ...
A More Private & Secure E-Mail System using Image Steganography (EPS) and Data Mining
AICTC '16: Proceedings of the International Conference on Advances in Information Communication Technology & Computing

Data mining is a practice of automatically exploring and analysis of large quantities of data in order to discover valid, potentially useful and understandable patterns in data [1]. The data provided may contain private and user sensitive data leads to ...
Secure and private search protocols for RFID systems

In many real world applications, there is a need to search for RFID tagged items. In this paper, we propose a set of protocols for secure and private search for tags based on their identities or certain criteria they must satisfy. When RFID enabled ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '07: Proceedings of the 2007 ACM symposium on Applied computing

March 2007

1688 pages

ISBN:1595934804

DOI:10.1145/1244002

Conference Chairs:
Yookun Cho
Seoul National University, Seoul, Korea
,
Roger L. Wainwright
University of Tulsa, Tulsa, Oklahoma
,
Hisham M. Haddad
Kennesaw State University, Kennesaw, Georgia
,
Sung Y. Shin
South Dakota State University, Brookings, South Dakota
,
Program Chair:
Yong Wan Koo
The University of Suwon, Gyeongggi-do, Korea

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 March 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC07

Sponsor:

SIGAPP

SAC07: The 2007 ACM Symposium on Applied Computing

March 11 - 15, 2007

Seoul, Korea

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
545
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Al-Eiadeh MQaddoura RAbdallah M(2024)Investigating the Performance of a Novel Modified Binary Black Hole Optimization Algorithm for Enhancing Feature SelectionApplied Sciences10.3390/app1412520714:12(5207)Online publication date: 14-Jun-2024
https://doi.org/10.3390/app14125207
Zerka FBarakat SWalsh SBogowicz MLeijenaar RJochems AMiraglio BTownend DLambin P(2020)Systematic Review of Privacy-Preserving Distributed Machine Learning From Federated Databases in Health CareJCO Clinical Cancer Informatics10.1200/CCI.19.00047(184-200)Online publication date: Nov-2020
https://doi.org/10.1200/CCI.19.00047
Park JLee D(2020)Parallelly Running k-Nearest Neighbor Classification Over Semantically Secure Encrypted Data in Outsourced EnvironmentsIEEE Access10.1109/ACCESS.2020.29845798(64617-64633)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2984579
Bansal RKumar SMahajan A(2017)Diagnosis of diabetes mellitus using PSO and KNN classifier2017 International Conference on Computing and Communication Technologies for Smart Nation (IC3TSN)10.1109/IC3TSN.2017.8284446(32-38)Online publication date: Oct-2017
https://doi.org/10.1109/IC3TSN.2017.8284446
Gheid ZChallal YYi XDerhab A(2017)Efficient and privacy-aware multi-party classification protocol for human activity recognitionJournal of Network and Computer Applications10.1016/j.jnca.2017.09.00598:C(84-96)Online publication date: 15-Nov-2017
https://dl.acm.org/doi/10.1016/j.jnca.2017.09.005
Kotecha RGarg S(2017)Preserving output-privacy in data stream classificationProgress in Artificial Intelligence10.1007/s13748-017-0114-86:2(87-104)Online publication date: 6-Feb-2017
https://doi.org/10.1007/s13748-017-0114-8
Xiong JDing SLi B(2017)An Improved Locality Preserving Projection Method for Dimensionality Reduction with Hyperspectral ImageAdvances in Swarm Intelligence10.1007/978-3-319-61833-3_34(321-329)Online publication date: 24-Jun-2017
https://doi.org/10.1007/978-3-319-61833-3_34
Asif HVaidya JShafiq BAdam N(2017)Secure and Efficient k-NN QueriesICT Systems Security and Privacy Protection10.1007/978-3-319-58469-0_11(155-170)Online publication date: 4-May-2017
https://doi.org/10.1007/978-3-319-58469-0_11
Sang YShen HTian HZhang Z(2016)Achieving Probabilistic Anonymity in a Linear and Hybrid Randomization ModelIEEE Transactions on Information Forensics and Security10.1109/TIFS.2016.256260511:10(2187-2202)Online publication date: Oct-2016
https://doi.org/10.1109/TIFS.2016.2562605
Khedr A(2016)Decomposable algorithm for computing k-nearest neighbours across partitioned dataInternational Journal of Parallel, Emergent and Distributed Systems10.1080/17445760.2015.105782031:4(334-353)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1080/17445760.2015.1057820
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents