本文已被：浏览 1494次 下载 4436次
Received:October 24, 2012 Revised:November 28, 2012
Received:October 24, 2012 Revised:November 28, 2012
中文摘要: 关联规则挖掘在数据挖掘中占有极其重要的地位, Apriori算法和FP-growth算法是当前关联规则中两大主要频繁项集发现算法. 研究了这两种算法的基本思想, 指出了算法各自的优缺点并通过具体的实例说明发现频繁项集的方法, 最后通过实验对算法进行了性能上的比较.
中文关键词: 关联规则 Apriori算法 FP-growth算法
Abstract:Mining of association rules in data mining plays an important role, Apriori algorithm and FP-growth algorithm are the two major association rules frequent itemsets discovery algorithm.study of the two kinds of the basic idea of the algorithm, points out the advantages and disadvantages of the algorithm through specific examples of frequent itemsets found method, finally through the experiment to the algorithm for the performance comparison.
文章编号： 中图分类号： 文献标志码：
基金项目:
| Author Name | Affiliation |
| YAN Jie | Youth League Committee, Wuyi University, Wuyi Shan 354300, China |
| QI Wen-Juan | Mathematics and Computer Science department, Wuyi University, Wuyi Shan 354300, China |
| Author Name | Affiliation |
| YAN Jie | Youth League Committee, Wuyi University, Wuyi Shan 354300, China |
| QI Wen-Juan | Mathematics and Computer Science department, Wuyi University, Wuyi Shan 354300, China |
引用文本：
晏杰,亓文娟.基于Aprior & FP-growth算法的研究.计算机系统应用,2013,22(5):122-125
YAN Jie,QI Wen-Juan.Research Based on Aprior & FP-growth Algorithm.COMPUTER SYSTEMS APPLICATIONS,2013,22(5):122-125
晏杰,亓文娟.基于Aprior & FP-growth算法的研究.计算机系统应用,2013,22(5):122-125
YAN Jie,QI Wen-Juan.Research Based on Aprior & FP-growth Algorithm.COMPUTER SYSTEMS APPLICATIONS,2013,22(5):122-125
