apriori {arules} | R Documentation

## Mining Associations with Apriori

### Description

Mine frequent itemsets, association rules or association hyperedges using the Apriori algorithm. The Apriori algorithm employs level-wise search for frequent itemsets. The implementation of Apriori used includes some improvements (e.g., a prefix tree and item sorting).

### Usage

    apriori(data, parameter = NULL, appearance = NULL, control = NULL)

### Arguments

`data` | object of class `transactions` or any data structure which can be coerced into `transactions` (e.g., a binary matrix or data.frame).
`parameter` | object of class `APparameter` or named list. The default behavior is to mine rules with minimum support of 0.1, minimum confidence of 0.8, maximum of 10 items (maxlen), and a maximal time for subset checking of 5 seconds (maxtime).
`appearance` | object of class `APappearance` or named list. With this argument item appearance can be restricted (implements rule templates). By default all items can appear unrestricted.
`control` | object of class `APcontrol` or named list. Controls the algorithmic performance of the mining algorithm (item sorting, report progress (verbose), etc.)

### Details

Calls the C implementation of the Apriori algorithm by Christian Borgelt for mining frequent itemsets, rules or hyperedges.

Note: Apriori only creates rules with one item in the RHS (Consequent)! The default value in `APparameter` for `minlen` is 1. This means that rules with only one item (i.e., an empty antecedent/LHS) like

{} => {beer}

will be created. These rules mean that no matter what other items are involved, the item in the RHS will appear with the probability given by the rule's confidence (which equals the support). If you want to avoid these rules then use the argument `parameter=list(minlen=2)`.

Notes on run time and memory usage: If the minimum `support` is chosen too low for the dataset, then the algorithm will try to create an extremely large set of itemsets/rules. This will result in very long run time and eventually the process will run out of memory. To prevent this, the default maximal length of itemsets/rules is restricted to 10 items (via the parameter element `maxlen=10`) and the time for checking subsets is limited to 5 seconds (via `maxtime=5`). The output will show if you hit these limits in the "checking subsets" line of the output. The time limit is only checked when the subset size increases, so it may run significantly longer than what you specify in maxtime. Setting `maxtime=0` disables the time limit.

Interrupting execution with Control-C/Esc is not recommended. Memory cleanup will be prevented resulting in a memory leak. Also, interrupts are only checked when the subset size increases, so it may take some time till the execution actually stops.

### Value

Returns an object of class `rules` or `itemsets`.

### Author(s)

Michael Hahsler and Bettina Gruen

### References

R. Agrawal, T. Imielinski, and A. Swami (1993) Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 207–216, Washington D.C.

Christian Borgelt and Rudolf Kruse (2002) Induction of Association Rules: Apriori Implementation. 15th Conference on Computational Statistics (COMPSTAT 2002, Berlin, Germany) Physica Verlag, Heidelberg, Germany.

Christian Borgelt (2003) Efficient Implementations of Apriori and Eclat. Workshop of Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL, USA).

APRIORI Implementation: www.borgelt.net/apriori.html

### See Also

`APparameter-class`, `APcontrol-class`, `APappearance-class`, `transactions-class`, `itemsets-class`, `rules-class`

### Examples

    data("Adult")
    ## Mine association rules.
    rules <- apriori(Adult,
    	parameter = list(supp = 0.5, conf = 0.9, target = "rules"))
    summary(rules)

[Package arules version 1.6-3 Index]