本文已被：浏览 1347次 下载 3590次
Received:September 21, 2012 Revised:October 18, 2012
Received:September 21, 2012 Revised:October 18, 2012
中文摘要: 深入研究关联规则算法, 针对Apriori算法瓶颈问题提出了一种改进算法, 该算法在构建向量矩阵的基础上, 只需要扫描一次事务数据库, 通过优化连接和剪枝, 提高了算法的运行效率. 研究和实验表明, 改进后的算法在大规模的事务数据库中, 较Apriori算法有明显的优势.
Abstract:In this paper, study of the association rules algorithm, aiming at the bottleneck problem of Apriori algorithm an improved algorithm is proposed. The algorithm on the basis of building a vector matrix, only need to scan a transaction database by optimizing the connections and pruning to improve the operating efficiency of the algorithm. Research and experiments show that the improved algorithm in a large-scale transaction database than Apriori algorithm has obvious advantages.
keywords: Association rules Apriori algorithm vector matrix
文章编号： 中图分类号： 文献标志码：
基金项目:
| Author Name | Affiliation |
| QI Wen-Juan | Mathematics and Computer Science department, Wuyi University, Wuyishan 354300, China |
| YAN Jie | Youth League Committee, Wuyi University, Wuyishan 354300, China |
| Author Name | Affiliation |
| QI Wen-Juan | Mathematics and Computer Science department, Wuyi University, Wuyishan 354300, China |
| YAN Jie | Youth League Committee, Wuyi University, Wuyishan 354300, China |
引用文本：
亓文娟,晏杰.数据挖掘中关联规则Apriori算法.计算机系统应用,2013,22(4):121-124
QI Wen-Juan,YAN Jie.Apriori Algorithm of Association Rules in Data Mining.COMPUTER SYSTEMS APPLICATIONS,2013,22(4):121-124
亓文娟,晏杰.数据挖掘中关联规则Apriori算法.计算机系统应用,2013,22(4):121-124
QI Wen-Juan,YAN Jie.Apriori Algorithm of Association Rules in Data Mining.COMPUTER SYSTEMS APPLICATIONS,2013,22(4):121-124
