A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carrie
资 源 简 介
A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists.
