The week's pick
Random Articles
Reseach Article
Privacy Preserving Association Rule Mining using Horizontally Partition Data: Review Paper
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 111 - Number 7 |
| Year of Publication: 2015 |
| Authors: Arpita B. Modh |
10.5120/19548-0726
|
Arpita B. Modh . Privacy Preserving Association Rule Mining using Horizontally Partition Data: Review Paper. International Journal of Computer Applications. 111, 7 ( February 2015), 7-9. DOI=10.5120/19548-0726
Abstract
In Data mining is used to extract interested pattern or knowledge from large amount of data using many data mining technique. However it may also display sensitive information about individuals compromising the individual right to privacy When a collection of data is split among various parties. Now Each and Every party would wants to keep its sensitive information private during the mining process. Privacy preserving data mining is to develop data mining method without increases the risk of misuse of data. The main aim of privacy preserving data mining is to find the global mining results by preserving the individual sites private data/information. The various methods such as randomization, perturbation, heuristic and cryptography techniques. To Find privacy pre serving association rule mining in horizontally and vertically partitioned databases. In this paper, the analysis of different methods for PPARM is performed and their results are compared. Horizontally Partitioned databases, algorithm that combines advantage of both RSA public key cryptosystem and Homomorphic encryption scheme and algorithm that uses Paillier cryptosystem to compute global supports are used. This paper reviews the wide methods used for mining association rules over horizontally distributed dataset while preserving privacy.
References
- R. Agrawal, and R. Srikant. Fast algorithms for mining association rules. In: Proceeding of the 20th International Conference on Very Large Data Bases, 1994:487-499.
- D. Cheung, J. Han, V. Ng, et al. A fast distributed algorithm for mining association rules. In: Proceedings of 1996 International Conference of Parallel and Distributed Information Systems 1996:31-42.
- Mahmoud Hussein, Ashraf El-Sisi, Nabil Ismail: Fast CryptographicPrivacy Preserving Association Rules Mining on DistributedHomogenous Data Base. Knowledge-Based Intelligent Information andEngineering Systems, Lecture Notes in Computer Science, Volume5178/2008, pp. 607 -- 616 (2008)
- Xuan Canh Nguyen, Hoai Bac Le, Tung Anh Cao, "An Enhanced Scheme For Privacy-Preserving Association Rules Mining On Horizontally Distributed Databases," In 2012 IEEE.
- R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In: Proceedings of The 2003 ACM SIGMOD International Conference on Management of Data. 2003:86-97.
- M. Kantarcioglu, and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned Data. IEEE Transaction on Knowledge and Data Engineering. 2004, 16(9):1026-1037.
Index Terms
Keywords