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
- Version0.1-1
- R versionunknown
- LicenseGPL-3
- Needs compilation?Yes
- opusminer citation info
- Last release02/03/2020
Documentation
Team
Christoph Bergmeir
Geoffrey I Webb
Show author detailsRolesAuthor, Copyright holderAngus Dempster
Show author detailsRolesContributor, Copyright holder
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports3 packages
- Linking To1 package