Research Article
ANALYSIS AND COMPARISON OF FREQUENT ITEMSET MINING TECHNIQUES
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 187 - Issue 106 |
| Published: May 2026 |
| Authors: Surati Sandipkumar B., Desai Apurva A. |
10.5120/ijcad5a86a23dc56
|
Surati Sandipkumar B., Desai Apurva A. . ANALYSIS AND COMPARISON OF FREQUENT ITEMSET MINING TECHNIQUES. International Journal of Computer Applications. 187, 106 (May 2026), 17-21. DOI=10.5120/ijcad5a86a23dc56
@article{ 10.5120/ijcad5a86a23dc56,
author = { Surati Sandipkumar B.,Desai Apurva A. },
title = { ANALYSIS AND COMPARISON OF FREQUENT ITEMSET MINING TECHNIQUES },
journal = { International Journal of Computer Applications },
year = { 2026 },
volume = { 187 },
number = { 106 },
pages = { 17-21 },
doi = { 10.5120/ijcad5a86a23dc56 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2026
%A Surati Sandipkumar B.
%A Desai Apurva A.
%T ANALYSIS AND COMPARISON OF FREQUENT ITEMSET MINING TECHNIQUES%T
%J International Journal of Computer Applications
%V 187
%N 106
%P 17-21
%R 10.5120/ijcad5a86a23dc56
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Frequent pattern mining is a technique used to mine frequent patterns from transaction dataset. In recent years, continuous efforts have been made in this area. Numerous algorithms have been developed using various data structures and techniques. In this paper, we discuss and compares some popular algorithms, such as Apriori, ECLAT, FP-Growth and PML with an example.
References
- R. Agrawal, T. Imielienski, and A. Swami, Mining Association Rules between Sets of Items in Large Databases, Proceeding of the ACM SIGMOD International Conference on Management of Data, Washington DC, May 1993, pp. 207–216.
- M. S. Nasir and Dr. R. B. S. Yadav, The Novel Approach based on Improving Apriori Algorithm and Frequent Pattern Algorithm for Mining Association Rule, International Journal of Innovative Research in Computer and Communication Engineering, Vol. 3, Issue 5, May 2015.
- R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules. Proc. 20th Int. Conf. on very Large Databases (VLDB 1994, Santiago de Chile), pp. 487–499, 1994, Morgan Kaufmann, San Mateo, CA, USA
- R. Agrawal and R. Srikant, Mining sequential patterns. Proceeding of the 11th International Conference on Data Engineering, pp:3-14, March 6-10, 1995, Taipei, Taiwan.
- . Han, J. Pei, Y. Yin and R. Mao, Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining Knowledge Discovery, 2004, pp: 53-87.
- W. Cheung, and O.R. Zaiane, 2003, Incremental mining of frequent patterns without candidate generation or support constraint, 7th IEEE international database engineering and applications symposium (IDEAS'03), 2003.
- M.J. Zaki, Scalable algorithms for association mining. IEEE Transactions on knowledge and data engineering, Vol. 12, No.3, May/June 2000, pp. 372-390.
- S. B. Surati and A. A. Desai, Pattern Mining (PM) Algorithm. VNSGU Journal of Science & Technology, Vol. 3, Issue 2, March 2012
- S. B. Surati and A. A. Desai, Pattern Mining using Linked list (PML): mine the frequent patterns from transaction dataset using linked list data structure, 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT), July 2017.
- K. Bhimavarapu, S. Yenninti and Y. Jayalakshmi, Association Rule Mining Algorithms and its Applications, Futuristic Trends in Computing Technologies and Data Sciences V3B5, Vol. 3, 2023
Index Terms
Keywords