%0 Journal Article
%T A New Association Rules Mining Algorithm by Improving Prune Efficiently<br>一个高效剪枝的新关联规则挖掘算法
%A JIA Fang-gui
%A PAN Hai-min
%A <br>郏方贵
%A 泮海敏
%J 计算机应用研究
%D 2004
%I 
%X Classifies the existing improving strategy for Apriori algorithm.The new algorithm unite the prune step and the join step in Apriori algorithm.By using a temporary itemsets named TQ to store the join result between specified itemset in Lk-1 and other itemsets in Lk-1,the new algorithm reduce the scanned set size from Lk-1 to L1.The mining efficiency is increased greatly.
%K Data Mining
%K Association Rules
%K Apriori Algorithm<br>数据挖掘
%K 关联规则
%K Apriori算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=34AE8400C25A0931&yid=D0E58B75BFD8E51C&vid=659D3B06EBF534A7&iid=708DD6B15D2464E8&sid=BBF7D98F9BEDEC74&eid=954CE65414DD94CA&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=4&reference_num=5