FrequentPatternMaxHeap frequentPatterns = growth(tree, minSupport, K,
treeCache, 0, attribute);
Patterns.put(attribute, frequentPatterns);
outputCollector.collect(attribute, frequentPatterns);
minSupportValue = Math.max(minSupportValue, minSupport.intValue() / 2);
log.info("Found {} Patterns with Least Support {}", Patterns.get(
attribute).count(), Patterns.get(attribute).leastSupport());
}
log.info("Tree Cache: First Level: Cache hits={} Cache Misses={}",
treeCache.getHits(), treeCache.getMisses());