Mining association rule efficiently based on data warehouse

来源期刊：中南大学学报(英文版)2003年第4期

论文作者：陈晓红 赖邦传 罗铤

文章页码：375 - 380

Key words：data mining; association rule mining; complete association rule set; least association rule set

Abstract: The conventional complete association rule set was replaced by the least association rule set in data warehouse association rule mining process. The least association rule set should comply with two requirements: 1) it should be the minimal and the simplest association rule set; 2) its predictive power should in no way be weaker than that of the complete association rule set so that the precision of the association rule set analysis can be guaranteed. By adopting the least association rule set, the pruning of weak rules can be effectively carried out so as to greatly reduce the number of frequent itemset, and therefore improve the mining efficiency. Finally, based on the classical Apriori algorithm, the upward closure property of weak rules is utilized to develop a corresponding efficient algorithm.