CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

Privacy Preserving Association Rule Mining in Vertically Partitioned Databases

by N. V. Muthu Lakshmi, K. Sandhya Rani
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 39 - Number 13
Year of Publication: 2012
Authors: N. V. Muthu Lakshmi, K. Sandhya Rani
10.5120/4883-7321

N. V. Muthu Lakshmi, K. Sandhya Rani . Privacy Preserving Association Rule Mining in Vertically Partitioned Databases. International Journal of Computer Applications. 39, 13 ( February 2012), 29-35. DOI=10.5120/4883-7321

@article{ 10.5120/4883-7321,
author = { N. V. Muthu Lakshmi, K. Sandhya Rani },
title = { Privacy Preserving Association Rule Mining in Vertically Partitioned Databases },
journal = { International Journal of Computer Applications },
issue_date = { February 2012 },
volume = { 39 },
number = { 13 },
month = { February },
year = { 2012 },
issn = { 0975-8887 },
pages = { 29-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume39/number13/4883-7321/ },
doi = { 10.5120/4883-7321 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:26:24.190529+05:30
%A N. V. Muthu Lakshmi
%A K. Sandhya Rani
%T Privacy Preserving Association Rule Mining in Vertically Partitioned Databases
%J International Journal of Computer Applications
%@ 0975-8887
%V 39
%N 13
%P 29-35
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data mining techniques are useful to discover hidden patterns from the large databases. Association rule mining is one of the important data mining techniques to discover relationships between items or item sets. In many organizations the database may exist in centralized or in distributed environment. In distributed environment, database may be partitioned in different ways such as horizontally partitioned, vertically partitioned and mixed mode which consists of both horizontal and vertical partitioning methods. The sites in the distributed environment interested to find association rules by participating themselves in the mining process without disclosing their individual private data/information. In this paper, a new model is proposed to find association rules by satisfying the privacy constraints for vertically partitioned databases at n number of sites along with data miner. This model adopts cryptography techniques such as encryption, decryption techniques and scalar product technique to find association rules efficiently and securely for vertically partitioned databases.

References
  1. Verykios, V.S., Bertino, E., Nai Fovino, I., Parasiliti, L., Saygin, Y., and Theodoridis, Y. (2004), State-of-he-art in privacy preserving data mining, SIGMOD Record, 33(1):50–57.
  2. Elisa Bertino , Igor Nai Fovino Loredana Parasiliti Provenza ,A Framework for Evaluating Privacy Preserving Data Mining Algorithms, Data Mining and Knowledge Discovery, 2005, 11, 121–154.
  3. Chris Clifton, Murat Kantarcioglu, Jaideep Vaidya, Xiaodong Lin, and Michael Y. Zhu(2003),Tools for privacy preserving distributed data mining, SIGKDD Explorations, Vol. 4, No. 2 pp1-7.
  4. Mahmoud Hussein, Privcacy preserving in assocaiton rule mining using cryptography, Master thesis, Menofyia University,2009
  5. Bart Goethals, Sven Laur, Helger Lipmaa, and Taneli Mielik¨ainen, On Private Scalar Product Computation for Privacy-Preserving Data Mining,
  6. Vaidya, J. and Clifton, C. 2002. Privacy preserving association rule mining in vertically partitioned data, 8th ACM SIGKDD, International Conference on Knowledge Discovery and Data Mining, ACM Press,pp. 639–644.
  7. Pradeep Shenoy, Jayant R. Haritsa, S. Sundarshan, Gaurav Bhalotia, Mayank Bawa, and Devavrat Shah. Turbo-charging vertical mining of large databases, In Proceedings of the Nineteenth ACM SIGMOD International Conference on Management of Data, pages 22{33, Dallas, TX, 2000.
  8. Chin-Chen Chang, Jieh-Shan Yeh, and Yu-Chiang Li, Privacy-Preserving Mining of Association Rules on Distributed Databases, IJCSNS International Journal of Computer Science and Network Security, VOL.6 No.11, November 2006.
  9. Lalanthika Vasudevan , S.E. Deepa Sukanya, N.Aarthi ,Privacy Preserving Data Mining Using Cryptographic Role Based Access Control Approach, Proceedings of the International Multi Conference of Engineers and Computer Scientists 2008 Vol I, IMECS 2008.
  10. Y. Lindell and B. Pinkas, Secure Multiparty Computation for Privacy-Preserving Data Mining, The Journal of privacy and Confidentiality (2009) , 1, Number 1, pp. 59-98.
  11. A.C. Yao. Protocols for secure computations, In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982.
  12. Ashraf El-Sisi , Fast Cryptographic Privacy Preserving Association Rules Mining on Distributed Homogenous Database, The International Arab journal of Information Technology, Vol. 7, No. 2, April 2010.
  13. Danfeng Yao, Roberto Tamassia ,Seth Proctor, Distributed Scalar Product Protocol with Application to Privacy Preserving Computation of Trust.
  14. Alan F. Karr, Xiaodong Lin, Ashish P. Sanil, JeromeP. Reiter, Privacy-Preserving Analysis of Vertically Partitioned Data Using Secure Matrix Products, Journal of Official Statistics, Vol.25, No.1, 2009. pp. 125–138.
  15. E. Poovammal, M. Ponnavaikko, Utility Independent Privacy Preserving Data Mining on Vertically Partitioned Data, Journal of Computer Science 5 (9): 666-673, 2009, Science Publications.
  16. Ioannidis I., Grama A., Atallah M., A secure protocol for computing dot products in clustered and distributed environments, Proceedings of International Conference on Parallel Processing, 2002. 379 – 384.
  17. Yiqun Huang, hengding Lu, HepingHu, Privacy preserving association rule mining with scalar product, Natural Language Processing and Knowledge Engineering, 2005. IEEE NLP-KE '05,Proceedings of 2005 IEEE, International Conference.
  18. Wenliang Du, Zhijun Zhan, A practical approach to solve Secure Multi-party Computation problems,Proceedings of NSPW’2002, workshop on New security paradigms, ACM publications.
  19. Moni Naor and Benny Pinkas. Efficient oblivious Transfer protocols. In Proceedings of SODA 2001 (SIAM Symposium on Discrete Algorithms), Washington, D.C., January 7-9 2001.
  20. Wenliang Du and Mikhail J. Atallah. Privacy preserving statistical analysis. In Proceeding of the Seventeenth Annual Computer Security Applications Conference, New Orleans, LA, December 10-14 2001.
  21. Alex Gurevich, Ehud Gudes, privacy Preserving data Mining Algorithms without the use of secure Computation or perturbation, 10th International Database Engineering and Applications Symposium (IDEAS’06),2006, IEEE.
  22. Syed Shams-ul-Haq, Csilla Farkas, Research on Contemporary Algorithms for Privacy Preserving Distributed Data Mining.
Index Terms

Computer Science
Information Sciences

Keywords

Privacy Preserving Association Rule Mining Distributed Databases Cryptography Scalar Product