hello, when i use fpgrowth to get association rules, but it always come to wrong, so confused.
Then i read the source code, i think i found a bug in line #102 of FrequentPatternMaxHeap.java, which " least.compareTo(frequentPattern) < 0 " should change to " least.compareTo(frequentPattern) > 0 ", the former will filter a lot frequent patterns come after. After modification, it comes to better, but when running on a file with size of 400m and the maxHeapSize =1000, minsupport=2, fpgrowth costs above 10 hours, sometimes it spents 2 hours to compute one feature, is anything wrong again? thanks for help
