| 一种改进的Apriori算法 |
| |
| 引用本文： | 符丽锦,覃华,邓海,孙欣.一种改进的Apriori算法[J].广西科学院学报,2013,29(1):1-3. |
| |
| 作者姓名： | 符丽锦 覃华 邓海 孙欣 |
| |
| 作者单位： | 广西大学计算机与电子信息学院 |
| |
| 摘 要： | 分析Apriori算法的不知,提出从先删减后连接的新角度来生成频繁项集,达到减少无用连接,进而减少剪枝步骤候选项集判断数量来改进Apriori算法。改进后的Apriori算法在时间效率上优于传统的算法,而且所获得的关联规则质量与传统算法相当。
|
| 关 键 词： | Apriori算法 关联规则 频繁项集 删减 |
| 收稿时间： | 2012/12/10 0:00:00 |
| 修稿时间： | 2012/12/20 0:00:00 |
An Improved Apriori Algorithm |
| |
| FU Li-jin,QIN Hu,DENG Hai and SUN Xin.An Improved Apriori Algorithm[J].Journal of Guangxi Academy of Sciences,2013,29(1):1-3. |
| |
| Authors: | FU Li-jin QIN Hu DENG Hai and SUN Xin |
| |
| Institution: | (School of Computer and Electronics Information,Guangxi University,Nanning,Guangxi,530004,China) |
| |
| Abstract: | Generating frequent itemsets from a new view of the connection after the deletion can reduce a lot of useless connections,thereby it can reduce the number of the candidate set to be determined in the pruning steps,and improve Apriori algorithm.Experimental results confirm that the improved Apriori algorithm is more time-efficient than traditional algorithms while the quality of association rules is the same as that of traditional algorithms. |
| |
| Keywords: | Apriori algorithm association rules frequent itemsets deletion |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《广西科学院学报》浏览原始摘要信息 |
| 点击此处可从《广西科学院学报》下载免费的PDF全文 |
|
