Performance comparison of apriori and FP-growth algorithms in generating association rules

Authors:
Daniel Hunyadi
Affiliations:
Department of Computer Science, "Lucian Blaga", University of Sibiu, Romania
Venue:
ECC'11 Proceedings of the 5th European conference on European computing conference
Year:
2011

Citing 5
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

Data Mining and Knowledge Discovery
A generalized parallel algorithm for frequent itemset mining

ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Rapid miner e-commerce

ACMOS'10 Proceedings of the 12th WSEAS international conference on Automatic control, modelling & simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we present a performance comparison between Apriori and FP-Growth algorithms in generating association rules. The two algorithms are implemented in Rapid Miner and the result obtain from the data processing are analyzed in SPSS. The database used in the development of processes contains a series of transactions belonging to an online shop.