arules - A Computational Environment for Mining Association Rules and Frequent Item Sets

Hornik, Kurt ORCID: https://orcid.org/0000-0003-4198-9911 and Grün, Bettina and Hahsler, Michael (2005) arules - A Computational Environment for Mining Association Rules and Frequent Item Sets. Journal of Statistical Software, 14 (15). pp. 1-25. ISSN 1548-7660

This is the latest version of this item.

[img]
Preview
PDF
arules.pdf

Download (413kB)

Abstract

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)

Item Type: Article
Keywords: data mining / association rules / frequent itemsets / R
Version of the Document: Published
Depositing User: ePub Administrator
Date Deposited: 26 Sep 2013 12:25
Last Modified: 24 Oct 2019 13:41
FIDES Link: https://bach.wu.ac.at/d/research/results/35951/
URI: https://epub.wu.ac.at/id/eprint/3976

Available Versions of this Item

Actions

View Item View Item

Downloads

Downloads per month over past year

View more statistics