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
国际会议
太原
英文
105-107
2011-02-26(万方平台首次上网日期,不代表论文的发表时间)