Research of An Association Rule Mining Algorithm Based on FP tree

摘要：

Based on analyzing an association rule mining algorithm called FP tree > a new association rule mining algorithm called QFP was presented. Through scanning the database only once, the QFP algorithm can convert a transaction database into a QFP tree after data preprocessing, and then do the association rule mining of the tree. The QFP algorithm is more integrity than the FP_growth algorithm, and retain the complete information for mining frequent patterns; it will not destroy the long pattern of any transaction, and significantly reduce the nonrelevant information. Experiments show that the QFP algorithm is more efficient if the aspect of time than the FP_growth algorithm.

关键词： Association ride mining Frequent Pattem (FP) FP_growth algorithm QFP algorithm

作者: Li Juan Ming De-ting

作者单位: Computer and Information Engineering Institute Jiangxi Agricultural University Nanchang,China Computer and Information Engineering Institute Jiangxi Agricultural University Nanchang, China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 559-563

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