The Improvement of Weighted Association Rules Arithmetic Based on FP-tree

摘要：

When digging association rules among items, the items are dealt in an equal way. However, it is usually not happen in databases in the real world.Different items always have different importance.To reflect them, The way of draw weight into items and use weight association rules can solve the problem.But weighted association rules arithmetic of these research based on Apriori arithmetic at the present,There are problems as these:the candidate itemsets is huge, the cost of resources is high and the efficiency is low. In regard to these problems, a new Weight Association Rules method(FP-WAR) was discussed. FP-WAR based on FP-tree to discover weighted association rules,FP-WAR handle weight clipping technology based on k-support bound of item sets to improve markedly efficiency of arithmetic.The experiment shows that the efficiency of FP-WAR arithmetic is much better than current way to discover weighted association rules.

关键词： KDD Weighted Association Rules Apriori FP-tree K-Support Bound

作者: Bin Zeng Xiao-Li Jiang Wei Zhao Chao Luo

作者单位: Center of Modern Educational TechnologyZhejiang Forestry UniversityHangzhou ,China Center of EcologyZhejiang Forestry UniversityHangzhou ,China TIANMU College Zhejiang Forestry University Hangzhou ,China

会议类型: 国际会议

会议名称: 2010 3rd International Conference on Advanced Computer Theory and Engineering(2010年第三届先进计算机理论与工程国际会议 ICACTE 2010)

会议地点: 成都

会议语种:英文

页码: 1-4

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