The week's pick
Random Articles
Reseach Article
Association Rule Hiding using Artificial Bee Colony Algorithm
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 33 - Number 2 |
| Year of Publication: 2011 |
| Authors: S.Vijayarani, M.Sathiya Prabha |
10.5120/3996-5659
|
S.Vijayarani, M.Sathiya Prabha . Association Rule Hiding using Artificial Bee Colony Algorithm. International Journal of Computer Applications. 33, 2 ( November 2011), 41-47. DOI=10.5120/3996-5659
Abstract
Data mining is the process of extracting the previously unknown patterns from large amount of data. Privacy preserving data mining is one of the research areas in data mining. The main objective of privacy preserving data mining is to provide the privacy for personally identifiable information in the datasets. Many privacy preserving techniques are used for protecting the confidential data items. Some of them are Privacy preserving Association Rule Mining, Privacy Preserving Clustering, Privacy Preserving Classification, Statistical disclosure control, K-anonymity etc. In this research paper, we have discussed about the association rule hiding problem. Association rule mining is one of the very important data mining techniques. The process of discovering itemsets that frequently co-occur in a transactional database so as to produce significant association rules that hold for the data is known as Association rule mining. Association rule hiding is the process of modifying the original database by hiding the sensitive data to protect the sensitive association rules. In this paper, we have proposed Artificial Bee Colony optimization algorithm for hiding the sensitive association rules. We analyze the efficiency of the Artificial Bee Colony optimization technique by using various performance factors.
References
- Arun K Pujari, “Data mining techniques”, second edition, ISBN: 978 81 7371 672 0
- Agarwal CC. and Yu PS., “Privacy-preserving data mining: Model and Algorithms”,(editors) CharuC.Aggarwal and Philip S. Yu, ISBN: 0-387-70991-8, 2008.
- Assaf Schuster, Ran Wolff, BobiGilburd, “Privacy Preserving data mining on data Grids in the presence of Malicious Participants”, IEEE International Symposium on High Performance Distributed Computing - HPDC 2004.
- Christian Borgelt, “Efficient Implementations of Apriori and Eclat”, Workshop of Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL, USA).
- Hahsler, M.; Buchta, C.; Gruen, B. &Hornik, K. “Arules: Mining Association Rules and Frequent Itemsets”,2009.
- R. Kessl SUI, “Frequent Substructure Mining- An Introduction”, 7. May 2009
- Manoj Gupta and R. C. Joshi, “Privacy Preserving Fuzzy Association Rules Hiding in Quantitative Data”, International Journal of Computer Theory and Engineering, Vol. 1, No. 4, October, 2009, 1793-8201
- Yogendra Kumar Jain, “An Efficient Association Rule HidingAlgorithm for Privacy Preserving Data Mining”, International Journal on Computer Science and Engineering (IJCSE)
- YuhongGuo,” Reconstruction-Based Association Rule Hiding”, Proceedings of SIGMOD2007 Ph.D. Workshop on Innovative Database Research 2007(IDAR2007), June 10, 2007, Beijing, China.
- Mohammad NaderiDehkordi , KambizBadie, Ahmad KhademZadeh , “A Novel Method for Privacy Preserving inAssociation Rule Mining Based on Genetic Algorithms”, journal of software, vol. 4, no. 6, august 2009
- VarunYadav, RichaJindal, “Security Information Hiding in Data Mining on the bases of Privacy Preserving Technique”, 2010 International Journal of Computer Application(0975-8887)Volume 1- No.15.
- S.Vijayarani,Dr. A.Tamilarasi, R.SeethaLakshmi, “Tabu Search based Association Rule hiding”, International Journal of Computer Application (0975-8887) Volume 19-No.1,April 2011
Index Terms
Keywords