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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A Survey on Closed Frequent Pattern Mining

by Prabha S, Shanmugapriya S, Duraiswamy K
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 63 - Number 14
Year of Publication: 2013
Authors: Prabha S, Shanmugapriya S, Duraiswamy K
10.5120/10538-5532

Prabha S, Shanmugapriya S, Duraiswamy K . A Survey on Closed Frequent Pattern Mining. International Journal of Computer Applications. 63, 14 ( February 2013), 47-52. DOI=10.5120/10538-5532

@article{ 10.5120/10538-5532,
author = { Prabha S, Shanmugapriya S, Duraiswamy K },
title = { A Survey on Closed Frequent Pattern Mining },
journal = { International Journal of Computer Applications },
issue_date = { February 2013 },
volume = { 63 },
number = { 14 },
month = { February },
year = { 2013 },
issn = { 0975-8887 },
pages = { 47-52 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume63/number14/10538-5532/ },
doi = { 10.5120/10538-5532 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:14:23.641612+05:30
%A Prabha S
%A Shanmugapriya S
%A Duraiswamy K
%T A Survey on Closed Frequent Pattern Mining
%J International Journal of Computer Applications
%@ 0975-8887
%V 63
%N 14
%P 47-52
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The identification of association rule mining has attracted many researchers. Several algorithms for effective discovery of association rule have been proposed. With the vast literature of closed frequent itemset discovery and association rule mining, still we are not able to say that we have found solution for most of the problems. This is the inspiration for my study towards the closed frequent itemsets and association rule mining. In this paper we reviewed few algorithms for closed frequent itemset and presented a comparison.

References
  1. Anthony J. T. Lee , Chun-Sheng Wang, Wan-Yu Weng, Yi-An Chen and Huei-Wen Wu,2008, "An efficient algorithm for mining closed inter-transaction itemsets", Data & Knowledge Engineering, Vol. 66, pp. 68–91.
  2. Anthony J. T. Lee, Wen-KwangTsao, Po-YinChen, Ming-ChihLin and Shih-HuiYang, 2010, "Mining frequent closed patterns in pointset databases", Information Systems, Vol. 35, pp. 335–351.
  3. Binesh Nair, Amiya Kumar Tripathy, 2011, "Accelerating Closed Frequent Itemset Mining by Elimination of Null Transactions", Journal of Emerging Trends in Computing and Information Sciences, Vol. 2, No. 7.
  4. Binesh Nair, and Amiya Kumar Tripathy, 2011, "Optimizing Frequent Pattern Mining through Elimination of Null Transactions", Computational Intelligence and Information Technology, vol. 250, pp 518-523.
  5. Claudio Lucchese, Salvatore Orlando, Raffaele Perego, 2006, "Fast and Memory Efficient Mining of Frequent Closed Itemsets", IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 1, pp. 21-36.
  6. El Far M. Moumoun L. , Gadi, T. , and Benslimane R. , 2010, "An efficient CHARM algorithm for indexation 2D/3D and selection of characteristic views" , Proceeding of 5th International Symposium on I/V Communications and Mobile Network (ISVC), pp. 1-4.
  7. Feng Pan, Gao Cong, Anthony K. H. Tung, Jiong Yang and Mohammed J. Zaki, 2003, "CARPENTER: Finding Closed Patterns in Long Biological Datasets, in Proceedings of the SIGKDD '03.
  8. Feng Pan, Gao Cong, Xu Xin and Anthony K. H. Tung, 2004, "COBBLER: Combining Column and Row Enumeration for Closed Pattern Discovery", In Proceeding of International Conference on Scientific and Statistical Database Management.
  9. Gao Cong, Kian-Lee Tan, Anthony K. H. Tung and Feng Pan, 2004, "Mining Frequent Closed Patterns in Microarray Data", Proceedings of the Fourth IEEE International Conference on Data Mining, pp. 363-366.
  10. Hongyan Liu, Jiawei Han, Dong Xin and Zheng Shao, 2006, "Mining Frequent Patterns from Very High Dimensional Data: A Top-Down Row Enumeration Approach", pp. 280-291.
  11. Hongyan Liu, Xiaoyu Wang, Jun He, Jiawei Han, Dong Xin and Zheng Shao, 2009, "Top-down mining of frequent closed patterns from very high dimensional data, Information Sciences, Vol. 179, pp. 899–924.
  12. J. Tahmores Nezhad and M. H. Sadreddini, 2007, "PTclose: A novel algorithm for generation of closed frequent itemsets from dense and sparse datasets", in Proceedings of the World Congress on Engineering, Vol. 1.
  13. Jian Pei, Jiawei Han and Runying Mao, 2000, "CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets", in Proceeding of the ACM-SIGMOD, pp. 11–20.
  14. Jianyong Wang, Jiawei Han and Jian Pei, 2003, "CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets", in proceeding of the SIGKDD '03.
  15. Jiawei Han, Jianyong Wang, Ying Lu, and Petre Tzvetkov, 2002, "Mining Top­K Frequent Closed Patterns without Minimum Support" , Proceedings of the IEEE International Conference on Data Mining, p. 211.
  16. Mohammed J. Zaki and Ching-Jui Hsiao, 1999, "CHARM: An Efficient Algorithm for Closed Association Rule Mining", Technical Report 99-10. , Computer Science Dept. , Rensselaer Polytechnic.
  17. Moonesinghe H. D. K. , 2006, Samah Fodeh and Pang-Ning Tan, "Frequent Closed Itemset Mining Using Prefix Graphs with an Efficient Flow-Based Pruning Strategy".
  18. Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal, 1999, "Efficient Mining of association rules using closed itemset lattices", Information Systems, vol. 24, No. 1, pp . 25-46.
  19. Rakesh Agrawal and Ramakrishnan Srikant, 1994, "Fast Algorithms for Mining Association Rules", in Proceedings of the 20th VLDB Conference.
  20. Rakesh Agrawal, Tomasz Imielinski and Arun Swami, 1993," Mining Association Rules between Sets of Items in Large Databases", in Proceedings of the ACM SIGMOD Conference.
  21. Wang J. , Han J. , and Li C. , 2005, " Frequent Closed Sequence Mining without Candidate Maintenance", IEEE Transactions on Knowledge and Data Engineering, vol. 19, No. 8, pp. 1042-1056.
  22. Yan, X. , Han, J. , and Afshar, R. , 2003, "CloSpan: Mining closed sequential patterns in large datasets", In Third SIAM International Conference on Data Mining (SDM), San Fransico, CA, pp. 166–177.
  23. Yi Pan, and HongYan Du, 2011, "A Novel Prefix Graph Based Closed Frequent Itemsets Mining Algorithm", proceeding of IEEE International Conference on Computational Science and Engineering, pp. 627-631.
  24. YuQing Miao, GuoLiang Chen, Bin Song, and ZhiHao Wang, 2006, "TP+Close: Mining Frequent Closed Patterns in Gene Expression Datasets", Data Mining and Bioinformatics ,Vol. 4316, pp 120-130 .
  25. Zaki M. J. , and Hsiao C. J. , 2005, "Efficient algorithms for mining closed itemsets and their lattice structure", IEEE Transactions on Knowledge and Data Engineering, vol. 17, No. 4, pp. 462 – 478.
Index Terms

Computer Science
Information Sciences

Keywords

Closed Frequent Itemset Association rule mining and Pattern

Powered by PhDFocusTM