Research of improved Apriori algorithm in mining association rules
Qian Xue-zhong · Jisuanji gongcheng yu sheji · 2008
After the method for mining association rules is analyzed,a dynamic algorithm of frequent itemsets mining based on undirected itemsets graph is put forward.The algorithm can get the new frequent itemsets through search the undirected itemsets graph once again,when the database and the minimum support are changed.Studies and analysis of the algorithm show that it cannot only scan the database once,but also has the virtues in high speed,less memory cost.