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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1-1 |
rolling linux/jammy R-4.5 | opusminer_0.1-1.tar.gz |
95.0 KiB |
0.1-1 |
rolling linux/noble R-4.5 | opusminer_0.1-1.tar.gz |
96.5 KiB |
0.1-1 |
rolling source/ R- | opusminer_0.1-1.tar.gz |
18.0 KiB |
0.1-1 |
latest linux/jammy R-4.5 | opusminer_0.1-1.tar.gz |
95.0 KiB |
0.1-1 |
latest linux/noble R-4.5 | opusminer_0.1-1.tar.gz |
96.5 KiB |
0.1-1 |
latest source/ R- | opusminer_0.1-1.tar.gz |
18.0 KiB |
0.1-1 |
2026-04-26 source/ R- | opusminer_0.1-1.tar.gz |
18.0 KiB |
0.1-1 |
2026-04-23 source/ R- | opusminer_0.1-1.tar.gz |
18.0 KiB |
0.1-1 |
2026-04-09 windows/windows R-4.5 | opusminer_0.1-1.zip |
415.9 KiB |
0.1-1 |
2025-04-20 source/ R- | opusminer_0.1-1.tar.gz |
18.0 KiB |