opusminer (version 0.1-1)
OPUS Miner Algorithm for Filtered Top-k Association Discovery
Description
Provides a simple R interface to the OPUS Miner algorithm (implemented in C++) for finding the top-k productive, non-redundant itemsets from transaction data. The OPUS Miner algorithm uses the OPUS search algorithm to efficiently discover the key associations in transaction data, in the form of self-sufficient itemsets, using either leverage or lift. See for more information in relation to the OPUS Miner algorithm.