2017/01/30 by Heaton Jeff, Heaton, Jeff
Computer Science · #Artificial Intelligence (cs.AI) #Data Mining Algorithms and Applications #Databases (cs.DB) #FOS: Computer and information sciences #Imbalanced Data Classification Techniques #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.1701.09042
openalex publication_date 2017/01/30 · openalex created_date 2017/08/31 · openalex updated_date 2026/07/28
Frequent itemset mining is a popular data mining technique. Apriori, Eclat,\nand FP-Growth are among the most common algorithms for frequent itemset mining.\nConsiderable research has been performed to compare the relative performance\nbetween these three algorithms, by evaluating the scalability of each algorithm\nas the dataset size increases. While scalability as data size increases is\nimportant, previous papers have not examined the performance impact of\nsimilarly sized datasets that contain different itemset characteristics. This\npaper explores the effects that two dataset characteristics can have on the\nperformance of these three frequent itemset algorithms. To perform this\nempirical analysis, a dataset generator is created to measure the effects of\nfrequent item density and the maximum transaction size on performance. The\ngenerated datasets contain the same number of rows. This provides some insight\ninto dataset characteristics that are conducive to each algorithm. The results\nof this paper's research demonstrate Eclat and FP-Growth both handle increases\nin maximum transaction size and frequent itemset density considerably better\nthan the Apriori algorithm.\n This paper explores the effects that two dataset characteristics can have on\nthe performance of these three frequent itemset algorithms. To perform this\nempirical analysis, a dataset generator is created to measure the effects of\nfrequent item density and the maximum transaction size on performance. The\ngenerated datasets contain the same number of rows. This provides some insight\ninto dataset characteristics that are conducive to each algorithm. The results\nof this paper's research demonstrate Eclat and FP-Growth both handle increases\nin maximum transaction size and frequent itemset density considerably better\nthan the Apriori algorithm.\n