Privacy-Preserving Distributed Mining Technique of Association Rules on Horizontally Partitioned Data

Authors(1) :-P. Kavitha

Huge volume of detailed personal data is regularly collected and sharing of these data is proved to be beneficial for data mining application. Such data include shopping habits, criminal records, medical history, credit records etc. On one hand such data is an important asset to business organization and governments for decision making by analyzing it. On the other hand privacy regulations and other privacy concerns may prevent data owners from sharing information for data analysis. In order to share data while preserving privacy data owner must come up with a solution which achieves the dual goal of privacy preservation as well as accurate clustering result. The sharing of data is often beneficial in data mining applications. It has been proven useful to support both decision-making processes and to promote social goals. However, the sharing of data has also raised a number of ethical issues. Some such issues include those of privacy, data security, and intellectual property rights. In this dissertation, we focus primarily on privacy issues in data mining, notably when data are shared before mining. Specifically, we consider some scenarios in which applications of association rule mining and data clustering require privacy safeguards. Addressing privacy preservation in such scenarios is complex. One must not only meet privacy requirements but also guarantee valid data mining results. In particular, we address the problem of transforming a database to be shared into a new one that conceals private information while preserving the general patterns and trends from the original database. To address this challenging problem, we propose a unified framework for privacy-preserving data mining that ensures that the mining.

Authors and Affiliations

P. Kavitha
Assistant Professor, Department of Computer Science, Arulmigu Palaniandavar Arts College For Women, Palani, Tamil Nadu, India

Data Mining, Association Rile Mining, Data transformation.

  1. C. Clifton, M. Kantarciofiglu, J. Vaidya, X. Lin, and M. Y. Zhu. Tools For Privacy Preserving Distributed Data Mining. SIGKDD Explorations, 4(2):28-34, 2002.
  2. O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game ľ A Completeness Theorem for Protocols with Honest Majority. In Proc. of the 19th Annual ACM Symposium on Theory of Computing, pages 218-229, New York City, USA, 1987.
  3. W. Du and M. J. Atallah. Secure Multi-Party Computation Problems and their Applications: A Review and Open Problems. In Proc. of 10thá ACM/SIGSAC 2001 New Security Paradigms Workshop, pages 13-22, Cloudcroft, New Mexico, September 2001.
  4. B. Pinkas. Cryptographic Techniques For Privacy-Preserving Data Mining. SIGKDD Explorations, 4(2):12-19, December 2002.
  5. S. Goldwasser. Multi-party Computations: Past and Present. In Proc. of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 1-6, SantaBarbara, CA, August 1997.
  6. A.C.-C. Yao. How to Generate and Exchange Secrets. In Proc. of the 27thá IEEE Symposium of Foundations of Computer Science, pages 162-167, Toronto, Ontario, Canada, October 1986.
  7. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In Proc. of the 20thá ACM Symposium on Theory of Computing, pages 1-10, Chicago, Illinois, USA, 1988.
  8. D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. In Proc. of the 20thá ACM Symposium on Theory of Computing, pages 11-19, Chicago, Illinois, USA, 1988.
  9. Y. Lindell and B. Pinkas. Privacy Preserving Data Mining. In Crypto 2000, Springer-Verlag (LNCS 1880), pages 36-54, Santa Barbara, CA, August 2000.
  10. J. R. Quinlan. Learning Efficient Classification Procedures and Their Application to Chess end Games. In R.S. Michalski, J.G. Carbonell, and T.M. Mitchell, eds., Machine Learning - An Artificial Intelligence Approach, pages 463-482, Tioga, Palo Alto, CA, 1983.
  11. M. Kantarcioglu and C. Clifton. Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data. In Proc. of The ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, Madison, Wisconsin, June 2002.
  12. J. Vaidya and C. Clifton. Privacy Preserving Association Rule Mining in Vertically Partitioned Data. In Proc. of the 8thá ACM SIGKDD Intl. Conf. on Knowlegde Discovery and Data Mining, pages 639-644, Edmonton, AB, Canada, July 2002.
  13. J. Vaidya and C. Clifton. Privacy-Preserving K-Means Clustering Over Vertically Partitioned Data. In Proc. of the 9th ACM SIGKDD Intl. Conf. on Knowlegde Discovery and Data Mining, pages 206-215, Washington, DC, USA, August 2003.
  14. M. Kantarcioglu and J. Vaidya. Privacy Preserving Naive Bayes Classifier for Horizontally Partitioned Data. In Proc. of the IEEE ICDM Workshop on Privacy Preserving Data Mining, pages 3-9, Melbourne, FL, USA, November 2003.

Publication Details

Published in : Volume 2 | Issue 5 | September-October 2017
Date of Publication : 2017-10-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 614-622
Manuscript Number : CSEIT1725100
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

P. Kavitha, "Privacy-Preserving Distributed Mining Technique of Association Rules on Horizontally Partitioned Data", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 5, pp.614-622, September-October-2017.
Journal URL : http://ijsrcseit.com/CSEIT1725100

Article Preview

Follow Us

Contact Us