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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Methodology for Hiding Sensitive Information and Pruning Infrequent Itemsets for Association Rule Mining

by K. Kavitha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 131 - Number 6
Year of Publication: 2015
Authors: K. Kavitha
10.5120/ijca2015907498

K. Kavitha . Methodology for Hiding Sensitive Information and Pruning Infrequent Itemsets for Association Rule Mining. International Journal of Computer Applications. 131, 6 ( December 2015), 42-45. DOI=10.5120/ijca2015907498

@article{ 10.5120/ijca2015907498,
author = { K. Kavitha },
title = { Methodology for Hiding Sensitive Information and Pruning Infrequent Itemsets for Association Rule Mining },
journal = { International Journal of Computer Applications },
issue_date = { December 2015 },
volume = { 131 },
number = { 6 },
month = { December },
year = { 2015 },
issn = { 0975-8887 },
pages = { 42-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume131/number6/23457-2015907498/ },
doi = { 10.5120/ijca2015907498 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:26:35.994509+05:30
%A K. Kavitha
%T Methodology for Hiding Sensitive Information and Pruning Infrequent Itemsets for Association Rule Mining
%J International Journal of Computer Applications
%@ 0975-8887
%V 131
%N 6
%P 42-45
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Association Rule Mining plays a major role in current research. This classical algorithm extracts frequent itemsets from large dataset which identifies Correlation between different items in the Transaction. Main issue in this algorithm is doubling the data scanning time. Many algorithms are proposed to find association rule and avoid complexity. This paper highlights two algorithms such as Novel Pruning approach for association rule mining and Hiding of Sensitive Association Rule by using improved Apriori algorithm. Finally, Suggested an integrated approach for Filtering Infrequent Itemsets and hiding Sensitive Association Rules using Same method which removes infrequent itemsets for hiding sensitive items in the Dataset.

References
  1. Shintre Sonali Sambhaji, Kalyanankar Pravin P. “ Mining and Hiding of Sensitive Association Rule by using Improved Apriori Algorithm”, Proceddings of 18th International Conference, Jan 2015 ISBN: 978-93-84209-82-7.
  2. Lalit Mohan Goyal, M.M.Sufyan Beg and Tanvir Ahmad, “ A Novel Approach for Association Rule Mining”, International Journal of Information Technology, Vol 7, Issn 0973-5658, Jan 2015.
  3. Agrawal, R., Imielinski, T., and Swami, A. N. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207-216.
  4. Agrawal R, Srikant R, ―Fast algorithms for mining association rules, Proceedings of the 20th Int’1 Conference on Very Large Databases[C], New York:IEEE press ,pp. 487-499, 1994.
  5. S. Brin, etc, ―Dynamic Itemset Counting and Implication rules for Market Basket Analysis‖, Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 255-264, 1997.
  6. M. J. Zaki, "Scalable algorithms for association mining," IEEE Transaction on Knowledge and Data Engineering, pp.372–390, 2000.
  7. J. Han, J. Pei, Y. Yin.: Minining frequent patterns without candidate generation. Proceedings of SIGMOD, 2000.
  8. F. C. Tseng and C. C. Hsu, ―Generating frequent patterns with the frequent pattern list‖, Proc. 5th Pacific-Asia Conf. on Knowledge Discovery and Data Mining , pp.376-386, April 2001.
  9. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules. In Proc. ICDT ’99, pages 398–416, 1999.
  10. M.J. Zaki, and C. Hsiao., "Charm: An efficient algorithm for closed itemset mining",Proc. SIAM Int'l Conf. Data Mining, PP. 457-473, 2002.
  11. J. Pei, J. Han, and R. Mao, " CLOSET: An efficient Algorithm for mining frequent closed itemsets", ACM SIGMOD workshop research issue in Data mining and knowledge Discovery, PP. 21-30, 2000.
  12. J. Wang, J. Han, and J. Pei, "CLOSET+: Searching for the best strategies for mining frequent closed itemsets", proc. Int'l Conf. Knowledge Discovery and Data Mining, PP. 236-245, 2003.
  13. G. Grahne, and J. Zhu, "Efficiently using prefix-trees in mining frequent itemsets", IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2003.
  14. C. Lucchese, S. Orlando, and R. Perego, "DCI_CLOSED: a Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets", IEEE Transaction On Knowledge And Data Engineering, Vol. 18, No. 1, PP. 21-35, 2006.
  15. D.Lin, Z. M. Kedem, Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Itemset, EDBT Conference Proceedings, 1998, pages 105-110.
Index Terms

Computer Science
Information Sciences

Keywords

Association Rule Apriori Support Confidence Pruning Hiding

Powered by PhDFocusTM