Efficient algorithm for mining association rules
Xiao Ren-cai · Jisuanji gongcheng yu sheji · 2008
Aimed at the disadvantages of scanning the database multiply and generating a large quantity of the candidate sets in the Apriori algorithm,a strategy of database optimization is presented,and frequent set pruning is combined and join optimization strategy.A new algorithm of mining association rule-NApriori algorithm is presented.The algorithm could reduce the size of the database gradually and the number of the candidate itemsets,avoid the repeated comparison of the same itemsets in the join procedure.The experiment in-dicates that this method has a better performance than the Apriori algorithm.