The purpose of these experiments is to answer the following:

How much faster is using previous duplicate hash?

How many candidates get pruned using modified Apriori Prune check subsets?

How does check subsets compare in speed to count subsets in the
ARMiner hash tree?

Does post candidate generation garbage collection free much memory?

Does post candidate generation garbage collection make mining faster
or slower?

How much faster is using remove candidates?

What percentage of instance-itemset comparisons does removing
candidates save?

How many failed candidate generation joins are avoided using prune
candidate generation?