Improved Apriori Algorithm Based on Weighted Mining Association Rules

摘要：

This paper discusses algorithms based on the Algorithm Apriori and discovers their existing questions.An improved weighted association rules (Algorithm W_Apriori) is proposed that makes the variations at the prune step of generating frequent items and generating association rule.As a result,more frequent items are discovered and the time of generating association rule is reduced.Experiments demonstrate the algorithm is feasible and efficient.

关键词： Association Rule Weight Frequent Itemset Algorithm Apriori W_Apriori

作者: Yuanyuan Zhao He Jiang Baoyou Sun Xiangjun Dong

作者单位: School of Information Science and Technology,Shandong Institute of Light Industry,Jinan,250353,China

会议类型: 国际会议

会议名称: 2008年国际电子商务、工程及科学领域的分布式计算和应用学术研讨会(2008 International Symposium on Distributed Computing and Applications for Business Engineering and Science)

会议地点: 大连

会议语种:英文

页码: 433-436

在线出版日期: 2008-07-27（万方平台首次上网日期，不代表论文的发表时间）