%0 Journal Article
%T Optimized Apriori Algorithm for Mining Association Rules<br>关联规则挖掘Apriori算法的优化
%A WANG Sheng-He
%A ZHU Yu-Quan
%A <br>王胜和
%A 朱玉全
%J 计算机系统应用
%D 2010
%I 
%X To address disadvantages of the Apriori algorithm, a new method is presented to optimize the Apriori. It can reduce the number of invalid candidate item sets through optimizing the strategy of frequent item sets pruning. In order to reduce the connections of items, avoid repeated comparison of the same items, it optimizes the joining strategy. And it also removes the useless transactions from database step by step in order to reduce the times of scanning transactions. The results of experiment show that the optimized algorithm is more efficient.
%K association rule
%K apriori algorithm
%K transaction reduction
%K data mining<br>关联规则
%K apriori算法
%K 事务压缩
%K 数据挖掘
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D4F6864C950C88FFCE5B6C948A639E39&aid=F254D8195E3E6D1D8E5BEF1DAF7F7E72&yid=140ECF96957D60B2&vid=2A8D03AD8076A2E3&iid=5D311CA918CA9A03&sid=95D537AC89B28832&eid=8BD23BD67BF01A5C&journal_id=1003-3254&journal_name=计算机系统应用&referenced_num=0&reference_num=5