| 一种改进的Apriori算法 |
| |
| 引用本文： | 周虹,马丽丽.一种改进的Apriori算法[J].佳木斯大学学报,2007,25(4):492-494. |
| |
| 作者姓名： | 周虹 马丽丽 |
| |
| 作者单位： | 佳木斯大学公共计算机教研部,黑龙江,佳木斯,154007;佳木斯热力公司,黑龙江,佳木斯,154002 |
| |
| 摘 要： | Apriori算法存在许多可以改进的地方.例如它需要反复读取数据库,并且读取的次数由项目集中的项目个数来确定,I/O负载与最大项目集的项数成正比.本文提出一种只读一次数据库的的改进算法.
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 |
| 文章编号： | 1008-1402（2007）04-0492-03 |
| 收稿时间： | 2007-04-18 |
| 修稿时间： | 2007-04-18 |
An Improved Algorithm of Apriori |
| |
| ZHOU Hong,MA Li-li.An Improved Algorithm of Apriori[J].Journal of Jiamusi University(Natural Science Edition),2007,25(4):492-494. |
| |
| Authors: | ZHOU Hong MA Li-li |
| |
| Institution: | 1. Commonality Teaching Department of Computer, Jiamusi University, Jiamusi 154007, China;2. Jiamusi Heating Power Company,Jiamusi 154002,China |
| |
| Abstract: | The algorithm of Apriori has many obvious shortcomings, which need to scan database frequently and the frequency is up to the number of items. I/O loads is directly proportional to the number of items of the largest item set. This article proposed an improved algorithm by which the database will be scanned only once. |
| |
| Keywords: | database association rule Apriori algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
