| 一种Apriori算法的改进 |
| |
| 引用本文： | 周兴斌,迟殿委.一种Apriori算法的改进[J].南昌大学学报(工科版),2008,30(2):1. |
| |
| 作者姓名： | 周兴斌 迟殿委 |
| |
| 作者单位： | 南昌大学计算中心； 南昌大学计算中心 江西南昌330031； 江西南昌330031； |
| |
| 基金项目： | 江西省科技攻关资助项目 |
| |
| 摘 要： | Apriori算法是关联规则的经典算法。从两个方面对其进行了改进,首先是在产生候选项集时采用了新的算法,更快地产生候选项集;其次,该算法采用了一种新的数据结构——索引结构来存储事务项集数据,提高了读取数据库中有效数据的速率,同时减少了一些不必要的数据扫描,利于更快地产
|
| 关 键 词： | 索引 候选项集 海量数据 关联规则 |
An Improvement of Apriori Algorithm |
| |
| ZHOU Xing-bin,CHI Dian-wei.An Improvement of Apriori Algorithm[J].Journal of Nanchang University(Engineering & Technology Edition),2008,30(2):1. |
| |
| Authors: | ZHOU Xing-bin CHI Dian-wei |
| |
| Abstract: | The Apriori algorithm is the classical algorithm of the association rule.This article made the improvement from two aspects,firstly a new algorithm was used when producing candidate itemset,thus the candidate set can be produced more quickly;Secondly,this algorithm used a data-index structure to save business item of collection data,enhancing the speed of reading the effective data in the database,simultaneously reducing scanning some non-essential data and produceing the frequent itemset more quickly.The two aspects can apparently improve the efficiency of the data mining,especially for the magnanimous data. |
| |
| Keywords: | association rule candidate itemset index magnanimous data |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《南昌大学学报(工科版)》浏览原始摘要信息 |
|
点击此处可从《南昌大学学报(工科版)》下载全文 |
