Weighted Association Rules Mining Algorithm Based on Binary Tree

摘要：

Introducing a new calculation of weighted support and confidence,on this basis,this paper proposes a weighted association rules mining algorithm based on binary tree,which can improve the weighted frequent itemsets mining methods.Based on Apriori algorithm,it used binary tree storage structure,and scans the database only once and can quickly calculate the support of itemsets.Therefore,this algorithm greatly reduces the I/O,and can improve the efficiency of weighted frequent itemsets generation effectively.

关键词： weighted association rules binary tree frequent itemsets

作者: XueQin Zhang Wei Jiang

作者单位: School of Computer China University of Mining and Technology Xuzhou,China

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

会议地点: 太原

会议语种:英文

页码: 105-107

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