opusminer: OPUS Miner Algorithm for Filtered Top-k Association Discovery

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 <http://i.giwebb.com/index.php/research/association-discovery/> for more information in relation to the OPUS Miner algorithm.

Package details

AuthorGeoffrey I Webb [aut, cph] (OPUS Miner algorithm and C++ implementation, http://i.giwebb.com/index.php/research/association-discovery/), Christoph Bergmeir [ctb, cre], Angus Dempster [ctb, cph] (R interface)
MaintainerChristoph Bergmeir <[email protected]>
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the opusminer package in your browser

Any scripts or data that you put into this service are public.

opusminer documentation built on May 30, 2017, 2:11 a.m.