摘要： 在分析FP_growth 关联规则挖掘算法的基础上，提出了一种MFP 的算法，给出了算法的工作原理。 MFP 算法能在一次扫描事务数据库过程中，把该数据库转换成MFP 树，然后对MFP 树进行关联规则挖掘。MFP 算法比FP_growth 算法减少一次对事务数据的扫描，因此具有较高的时间效率。
关键词:
关联规则挖掘；FP_growth 算法；MFP 算法
Abstract: Based on fully analyzing the FP_growth, an association rule mining algorithm, this paper presents a new association rule mining algorithm called MFP. The MFP algorithm can convert a transaction database into a MFP tree through scanning the database only once, and then do the mining of the tree. Because the MFP algorithm scans a transaction database one time less than the FP_growth algorithm, the MFP algorithm is more efficient with time.
Key words:
Association rule mining; FP_growth algorithm; MFP algorithm
高 俊，何守才. 布尔型关联规则挖掘算法研究[J]. 计算机工程, 2006, 32(1): 116-118，141.
GAO Jun , HE Shoucai. A Fast Association Rule Mining Algorithm[J]. Computer Engineering, 2006, 32(1): 116-118，141.