Description: 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. -A program to find frequent itemsets (also c losed and maximal) with the eclat algorithm, which carries out a depth first search on the sub set lattice and determines the support of items ets by intersecting transaction lists. Platform: |
Size: 31744 |
Author:无心 |
Hits:
Description: 数据挖掘中关联规则的eclat算法在VC下的实现-Data Mining Association Rules Eclat algorithm in the realization of the next VC Platform: |
Size: 374784 |
Author:raul |
Hits: