Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs

Inverse frequent set mining (IFM) is the problem of computing a transaction database D satisfying given support constraints for some itemsets, which are typically the frequent ones. This article pr...