一种新的高效关联规则数据挖掘算法

A New Kind of High Efficient Algorithm for Mining Association Rules

在分析关联规则的数据挖掘算法基础上，针对Ａｐｒｉｏｒｉ算法进行深入研究，提出了改进算法ＦＡ，并在实际项目中加以应用．算法ＦＡ在计算选项集支持度所涉及的记录数目将小于事务数据库中原记录数目，提高了原算法的效率，具有一定的实用性．

On the base of analyzing theory of mining association rules, analyzes the Apriori algorithm and pres- ents a high efficient updating algorithm FA.The result of this paper is carried out in some practical project On the aspect of calculating candidate item set support degrees concerning record numbers,the FA algorithm is less than records numbers in work DB. It raises the efficiency of original algorithm. The new algorithm is practi- cal.