opusminer (0.1-0)

0 users

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 for more information in relation to the OPUS Miner algorithm.

Maintainer: Christoph Bergmeir
Author(s): 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)

License: GPL-3

Uses: arules, Matrix, Rcpp

Released almost 3 years ago.



  (0 votes)


  (0 votes)

Log in to vote.


No one has written a review of opusminer yet. Want to be the first? Write one now.

Related packages: BayesTree, ElemStatLearn, GAMBoost, ROCR, RXshrink, arules, caret, e1071, earth, effects, elasticnet, gbm, glmpath, grplasso, ipred, kernlab, klaR, lars, lasso2, maptree(20 best matches, based on common tags.)

Search for opusminer on google, google scholar, r-help, r-devel.

Visit opusminer on R Graphical Manual.