CoverSize : Tool for Frequent Itemset Mining using CP
CoverSize is a building block using to tackle 3 problems of Itemset Mining : Frequent Itemset Mining, Frequent Closed Itemset mining and Discriminative Itemset Mining.
CoverSize is carried out in OscaR Solver.
Experiments are available Here
- > Download
- User version : oscar.coversize.1.0.0.jar
- Developper link : https://projetsJOHN@bitbucket.org/projetsJOHN/coversize
- Solver link : Oscar Solver CP.DM module
- Datasets : fim.zip
- > Relevant publications
- CoverSize: A Global Constraint for Frequency-Based Itemset Mining, Schaus, Pierre, Aoga John O. R., and Guns Tias , Principles and Practice of Constraint Programming: 23rd International Conference, {CP 2017}, Volume 10416, Melbourne, VIC, Australia, p.529–546, (2017). [PDF][Slides]