International Journal of Computational Linguistics Research

DLINE Journals portal

Home

New Journals

Browse Journals

Journal Prices

For Authors

Print ISSN: 0976-416X
Online ISSN: 0976-4178

About IJCLR
	DLINE Portal Home Home Aims & Scope Editorial Board Current Issue Next Issue Previous Issue Sample Issue Upcoming Conferences Self-archiving policy Alert Services Be a Reviewer Publisher Paper Submission Subscription Contact us

How To Order
	Order Online Price Information Request for Complimentary Print Copy

For Authors
	Guidelines for Contributors Online Submission Call for Papers Author Rights

RELATED JOURNALS

Journal of Digital Information Management (JDIM)

Journal of Multimedia Processing and Technologies (JMPT)

International Journal of Web Application (IJWA)

International Journal of Computational Linguistics Research

NOV-MFI: A Novel Algorithm for Maximal Frequent Itemset Mining

Huan Phan
Faculty of Mathematics and Computer Science, University of Science, VNU-HCM, Ho Chi Minh , 700000, Vietnam & Division of IT, University of Social Sciences and Humanities, VNU-HCM, Ho Chi Minh, 700000, Vietnam

Abstract: Since data explosion, data mining in transactional databases are increasingly important. There are many techniques for data mining such as mining association rule, the most important and well-researched. Moreover, maximal frequent itemset mining is one of the basic but time-consuming steps in the mines of association rules. Most algorithms used in the literature find maximal frequent itemset on search space items that have support at least minsup and not be used again for mining. In this paper, we propose a novel algorithm called NOV-MFI for mining maximal frequent itemsets in transactional databases. Advantages of NOV-MFI algorithms are reuse and easily expanded in distributed systems. Finally, experimental results show that the proposed algorithms are better than other existing algorithms on both real and synthetic datasets.

Keywords: Association Rules, Maximal Frequent Itemset, NOV-MFI Algorithm NOV-MFI: A Novel Algorithm for Maximal Frequent Itemset Mining

DOI:https://doi.org/10.6025/jcl/2020/11/2/60-72

Full_Text PDF 1.79 MB Download: 190 times

References:

[1] Agrawal, R., Imilienski, T., Swami, A. (1993). Mining association rules between sets of large databases, In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, DC, p. 207-216.
[2] Dong, J., Han, M. (2007). BitTableFI: An efficient mining frequent itemsets algorithm, Knowledge-Based Systems, 20 (4) 329–335.
[3] Song, W., Yang, B. (2008). Index-BitTableFI: An improved algorithm for mining frequent itemsets, Knowledge-Based Systems, 21, 507–513.
[4] Agarwal, R., Prasad, V. (2000). Depth first generation of long patterns, In: Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, p.108–118.
[5] Burdick, D., Calimlim, M., Gehrke, J. (2001). MAFIA: a maximal frequent itemset algorithm for transactional databases, In: IEEE Intl. Conf. on Data Engineering, p. 443–452, 2001.
[6] Gouda, K., Zaki, M. J. (2005). GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets, In: IEEE International Conference on Data Mining and Knowledge Discovery, 11, 1–20.
[7] Wang, H. (2015). MaxMining: A Novel Algorithm for Mining Maximal Frequent Itemset, Applied Mechanics and Materials, p. 1765-1768.
[8] Bajaj, S. B. (2017). Newgenmax: A Novel Algorithm for Mining Maximal Frequent Itemsets Using The Concept of Subset Checking, International Journal of Engineering Applied Sciences and Technology, 2 (5) 101-113.
[9] Jabbour, S., Mana, F. Z., Sais, L. (2017). On Maximal Frequent Itemsets Enumeration, In: Abraham A., Haqiq A., Muda A., Gandhi N. (eds) Proceedings of the Ninth International Conference on Soft Computing and Pattern Recognition (SoCPaR 2017). Advances in Intelligent Systems and Computing, vol 737. Springer, Cham, p. 151-160.
[10] Pan, Z., Liu, P., Yi, J. (2018). An Improved FP-Tree Algorithm for Mining Maximal Frequent Patterns, 10th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA), Changsha, Hunan, China, p. 309-312. doi:10.1109/ICMTMA.2018.00082.
[11] Philippe, F.V., Jerry, C. W. L., Bay, V., Tin, C. T., Ji, Z., Bac, L. (2017). A survey of itemset mining, Wiley Interdisc. Rew - Data Mining and Knowledge Discovery, 7(4).
[12] Phan, H., Le, B. (2018). A Novel Parallel Algorithm for Frequent Itemsets Mining in Large Transactional Databases, In: Perner P. (eds) Advances in Data Mining. Applications and Theoretical Aspects. ICDM 2018. Lecture Notes in Computer Science, Vol 10933. Springer, Cham, p. 272 – 287, 2018.

DLINE Journals portal