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.
https://anaconda.org/r_test/r-opusminer/badges/version.svg
https://anaconda.org/r_test/r-opusminer/badges/latest_release_date.svg
https://anaconda.org/r_test/r-opusminer/badges/latest_release_relative_date.svg
https://anaconda.org/r_test/r-opusminer/badges/platforms.svg
https://anaconda.org/r_test/r-opusminer/badges/license.svg
https://anaconda.org/r_test/r-opusminer/badges/downloads.svg