| 基于矩阵的Apriori算法的优化 |
| |
| 引用本文： | 梅成,周兴斌. 基于矩阵的Apriori算法的优化[J]. 计算机与现代化, 2008, 0(12): 5-7 |
| |
| 作者姓名： | 梅成 周兴斌 |
| |
| 作者单位： | 南昌大学计算中心,江西,南昌,330031 |
| |
| 基金项目： | 江西省科技攻关项目 |
| |
| 摘 要： | 在数据挖掘中关联规则挖掘是很重要的一个方面,而Apriori算法是进行关联规则挖掘的经典算法。本文首先分析了经典Apriori算法,然后利用矩阵的思想对其改进,并利用事务压缩的思想对矩阵进行压缩。改进后的算法明显提高了Apriori算法的效率。
|
| 关 键 词： | 关联规则 Apriori算法 事务压缩 矩阵 |
An Improvement of Apriori Algorithm Based Matrix |
| |
| MEI Cheng,ZHOU Xing-bin. An Improvement of Apriori Algorithm Based Matrix[J]. Computer and Modernization, 2008, 0(12): 5-7 |
| |
| Authors: | MEI Cheng ZHOU Xing-bin |
| |
| Affiliation: | (Computing Center, Nanchang University, Nanehang 330031, China) |
| |
| Abstract: | Mining association rule is a very important facet for data mining,while Apriori algorithm is classic algorithm for association rule.The paper analyzes the classic Apriori algorithm first,then modifies it based on matrix and compresses the matrix based on transaction compression.The modified algorithm obviously improves the efficency of Apriori algorithm. |
| |
| Keywords: | association rule Apriori algorithm transaction compression matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
