Hi,
The original
FPGrowth algorithm takes as input a threshold named "
minsup" and a
transaction database.
A
frequent itemset is an itemset having a support higher or equal to minsup.
FPGrowth finds all frequent itemsets.
If I understand well, you say that you want to find all frequent and infrequent itemsets at the same time. If an infrequent itemset is an itemset that is not frequent, then you could just set minsup = 0 and you will get all the itemsets.
If not sure if it is what you means.
If you are just interested by some infrequent itemset but not all of them, you could have a look at "rare itemsets" and "perfectly rare itemsets". There are some algorithms for that in
SPMF.
Philippe
Edited 1 time(s). Last edit at 04/28/2013 06:41AM by webmasterphilfv.