CRAN/E | opusminer

opusminer

OPUS Miner Algorithm for Filtered Top-k Association Discovery

Installation

About

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.

Citation opusminer citation info
Copyright OPUS Miner algorithm and C++ implementation Copyright (C) 2012-2017 Geoffrey I Webb, R interface Copyright (C) 2017 Angus Dempster.

Key Metrics

Version 0.1-1
Published 2020-02-03 1549 days ago
Needs compilation? yes
License GPL-3
CRAN checks opusminer results

Downloads

Yesterday 7 -50%
Last 7 days 79 +36%
Last 30 days 199 +11%
Last 90 days 518 -31%
Last 365 days 2.502 -30%

Maintainer

Maintainer

Christoph Bergmeir

christoph.bergmeir@monash.edu

Authors

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)

Material

Reference manual
Package source

In Views

MachineLearning

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

opusminer archive

Imports

Rcpp ≥ 0.12.9
arules ≥ 1.5-0
Matrix ≥ 1.2-7
methods

LinkingTo

Rcpp