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.

Version: 0.1-0
Imports: Rcpp (≥ 0.12.9), arules (≥ 1.5-0), Matrix (≥ 1.2-7), methods
LinkingTo: Rcpp
Published: 2017-02-16
Author: Geoffrey 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)
Maintainer: Christoph Bergmeir <christoph.bergmeir at monash.edu>
License: GPL-3
Copyright: OPUS Miner algorithm and C++ implementation Copyright (C) 2012-2017 Geoffrey I Webb, R interface Copyright (C) 2017 Angus Dempster.
NeedsCompilation: yes
Citation: opusminer citation info
In views: MachineLearning
CRAN checks: opusminer results


Reference manual: opusminer.pdf
Package source: opusminer_0.1-0.tar.gz
Windows binaries: r-devel: opusminer_0.1-0.zip, r-release: opusminer_0.1-0.zip, r-oldrel: opusminer_0.1-0.zip
OS X Mavericks binaries: r-release: opusminer_0.1-0.tgz, r-oldrel: opusminer_0.1-0.tgz


Please use the canonical form https://CRAN.R-project.org/package=opusminer to link to this page.