A New Parallel Algorithm for Mining Maximum Frequent Itemsets Based on Maximum Complete Subgraph

• 一种基于极大完全子图的最大频繁项集并行挖掘算法