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.
- 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 holder@http://i.giwebb.com/index.php/research/association-discovery/Angus Dempster
Show author detailsRolesContributor, Copyright holder
Insights
Last 30 days
This package has been downloaded 203 times in the last 30 days. More than a random curiosity, but not quite a blockbuster. Still, it's gaining traction! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 10 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 2,524 times in the last 365 days. Now we’re talking! This work is officially 'heard of in academic circles', just like those wild research papers on synthetic bananas. The day with the most downloads was Jul 21, 2024 with 65 downloads.
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