← Back to VOLUME 1, ISSUE 9, NOVEMBER 2012
This work is licensed under a Creative Commons Attribution 4.0 International License.
An Efficient Algorithm for Privacy Preserving Data Mining Using Heuristic Approach
M.Mahendran, Dr.R.Sugumar, K.Anbazhagan, R.Natarajan
Research Scholar, Dept. of CSE, CMJ University, Shillong, Meghalaya, India Associate Professor, Dept. of CSE, VelMultitech Dr. RR Dr.SR Engineering College, Chennai, India Research Scholar, Dept. of CSE, CMJ University, Shillong, Meghalaya, India Research Scholar, Dept. of CSE, CMJ University, Shillong, Meghalaya, India
Abstract: Privacy preserving data mining is an important topic on which lot of researchers going on last years. There are many approaches to hide association rule. In this paper Efficient Heuristic approach method is proposed which is more effective to hide association rule. The objective of this algorithm is to extract relevant knowledge from large amount of data, while protecting at the time sensitive information. The proposed method focused on hiding set of frequent items containing highly sensitive knowledge that only remove information from transactional database with no hiding failure.
Keywords: Minimum Confidence, Minimum Support, Itemset, Association rules.
Keywords: Minimum Confidence, Minimum Support, Itemset, Association rules.
π 27 views
Downloads: Download PDF
This work is licensed under a Creative Commons Attribution 4.0 International License.How to Cite:
[1] M.Mahendran, Dr.R.Sugumar, K.Anbazhagan, R.Natarajan, βAn Efficient Algorithm for Privacy Preserving Data Mining Using Heuristic Approach,β International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)