arules - A computational environment for mining association rules and frequent item sets

Mining frequent itemsets and association rules is a popular and well researched approach
for discovering interesting relationships between variables in large databases. The
R package arules presented in this paper provides a basic infrastructure for creating and
manipulating input data sets and for analyzing the resulting itemsets and rules. The package
also includes interfaces to two fast mining algorithms, the popular C implementations
of Apriori and Eclat by Christian Borgelt. These algorithms can be used to mine frequent
itemsets, maximal frequent itemsets, closed frequent itemsets and association rules. (authors' abstract)