| 关联规则Apriori算法的改进 |
| |
| 引用本文： | 陈正权,王宇一.关联规则Apriori算法的改进[J].江南大学学报(自然科学版),2012,11(3):294-299. |
| |
| 作者姓名： | 陈正权 王宇一 |
| |
| 作者单位： | 1. 江苏信息职业技术学院计算机工程系,江苏无锡214153;苏州大学计算机科学与技术学院,江苏苏州215006
2. 江苏信息职业技术学院计算机工程系,江苏无锡,214153 |
| |
| 摘 要： | 针对Apriori算法存在多次扫描数据库及产生大量候选项集的缺陷,提出了一种改进算法.该算法只需扫描数据库一次,并将事务变换成二进制存储到数据库,可节省存储空间、提高速度.实验结果表明,改进算法挖掘关联规则的效率有较大提高.
|
| 关 键 词： | 关联规则 Apriori算法 频繁项集 |
Research on Association Rules Apriori Algorithm Improvement |
| |
| CHEN Zheng-quan
,
WANG Yu-yi.Research on Association Rules Apriori Algorithm Improvement[J].Journal of Southern Yangtze University:Natural Science Edition,2012,11(3):294-299. |
| |
| Authors: | CHEN Zheng-quan WANG Yu-yi |
| |
| Institution: | 1(1.Department of Computer Engineering,Jiangsu College of Information Technology,Wuxi 214153,China;2.School of Computer Science and Technology,Soochow University,Suzhou 215006,China) |
| |
| Abstract: | To address the defects resultsed from repeatedly scanning the database and producing a large number of candidate itemsets for Apriori algorithm,We propose an improved algorithm.The algorithm only needs to scan database once,and the affairs are transformed into a binary and stored in the database,thus the storage space is saved and the speed is accelerated.Experimental results show that the efficiency of the improved algorithm for mining association rules has improved greatly. |
| |
| Keywords: | association rule Apriori algorithm frequent itemsets |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
