Research on improving Apriori algorithm based on interested table

The Apriori algorithm is a most influential one to excavate association rules. The basic idea of the algorithm is: identify all the frequent itemsets to get association rule. This paper presents the improved Apriori algorithm based on interested items, which mainly construct an ordered interested table and traverse it to excavate frequent itemsets quickly. The paper also by writing c# code achieves the improved algorithm. Confirmed by many experiments, this algorithm is better than traditional algorithms in time consuming.