Algorithm 2 can be
used to extend Algorithm 1 with a second pass in such
a case. The algorithm simply computes the collection
of all sets that possibly could be frequent. This can be
done in a similar way that candidates are generated in
the algorithms for finding frequent sets.