Maximal frequent item set mining with establishment of frequent item set vectors

A Fast Algorithm for Mining Maximum Frequent Item Sets;

A frequent itemsets mining algorithm based on set;

Algorithm for mining maximal frequent itemsets based on FP-tree;

Research on frequent itemsets based on SQL;

Mining algorithm of association rule based on frequent itemsets candidate;

Algorithm based on adjacent lattice for finding frequent itemsets;

Multi-subjected clustering algorithm based on frequent itemsets;

Research on frequent item sets discovery algorithm Apriori;

An efficient algorithm, RIFCI, for mining association rule, is proposed by simultaneously mining the frequent closed item sets instead of traditional frequent item sets and at the mean time exploring both the item set space and transaction space, as is distinguished from all previous association mining methods that exploit only the item set search space.

The improved FP-tree structure is adopted and the global frequent itemsets are mined by transmitting constrained sub-tree.

Aiming at the problem that there exists prolific candidate sets and the communication cost is high for obtaining global frequent itemsets in distributed mining algorithms,an algorithm FDMA(fast distributed mining algorithm) for mining global frequent itemsets in distributed database is proposed.