| 基于Apriori的改进算法 |
| |
| 引用本文： | 陈静.基于Apriori的改进算法[J].大众科技,2012(6):46-47. |
| |
| 作者姓名： | 陈静 |
| |
| 作者单位： | 盐都广播电视大学,江苏 盐城 224006 |
| |
| 摘 要： | 关联规则的提取是数据挖掘中的重要研究内容,对关联规则提取中的Apriori算法进行了分析与研究,针对该算法的运算效率不高,对该算法进行了改进,提出了Apriori改进算法.Apriori改进算法采用二进制数据垂直表示方法,只用扫描事务数据库一次得到一阶大项集的二进制数据垂直表示.K阶候选项集的操作只要基于这个一阶大项集,而不需重复扫描数据库,从而提高了挖掘算法的效率.
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 Apriori改进算法 |
Based on the improved algorithm Apriori |
| |
| Abstract: | Association Rules is the extraction of data mining in the important research,The extraction of association rules Apriori algorithm analysis and research,The algorithm for computing efficiency is not high,By improving the algorithms,the improved Apriori proposed algorithm.The improved Apriori algorithm using binary data that the vertical approach,Scanning Service database used only once by a large band of binary data sets that vertical.K-order designate the options set for this operation as long as the first order of the large-,Scanning the database without having to repeat,Thereby improving the efficiency of the mining algorithms. |
| |
| Keywords: | data-mining association rules Apriori algorithm the improved Apriori algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
