An Association Mining Algorithm Based on Matrix
Chunping Li · Jisuanji gongcheng · 2006
Apriori algorithm can find out the associations of the data by finding the frequent itemsets by degrees. But it has the performance bottleneck when searching for the high level frequent itemsets. A new algorithm that can directly find the high level frequent itemsets is proposed in this paper. This algorithm can effectively resolve the bottleneck of Apriori. The result of the experiment shows that this algorithm can achieve better performance than Apriori and is more feasible especially when the degree of the frequent itemset is high.