一种基于Apriori的关联规则的改进算法的研究 |
| |
引用本文: | 刘娟娟,刘建平.一种基于Apriori的关联规则的改进算法的研究[J].工业控制计算机,2012,25(6):82-82,85. |
| |
作者姓名: | 刘娟娟 刘建平 |
| |
作者单位: | 浙江理工大学信息电子学院,浙江杭州,310018 |
| |
摘 要: | Apriori算法是关联规则的经典算法,并己经被越来越多的企业使用。它在给企业带来经济效益的同时,也让人们意识到算法自身的不足:第一,该算法在扫描事务数据库的次数过多,从而需要承担很大的I/O负载;第二,它可能产生庞大的候选集。为了提高Apriori算法的效率,针对减少扫描事务数据库次数的方法,提出一种改进挖掘效率的算法。
|
关 键 词: | Apriori 关联规则 数据挖掘 |
An Improved Lgorithm for Mining Association Rules Based on Apriori Algorithm |
| |
Affiliation: | Liu Juanjuan et al |
| |
Abstract: | Apriori algorithm brings to the enterprise economic benefits,and also makes people aware of the algorithm deficiencies: firstly,when applying to scan the transaction database,the algorithm costs so much times that results in a lot of I/O spending;secondly, it can produce huge candidate set.In order to improve the efficiency of the Apriori algorithm, this pa- per puts forward to an improved Apriori algorithm with higher mining efficiency according to reduce I/O spending. |
| |
Keywords: | apriori algorithm association rule data mining |
本文献已被 CNKI 维普 万方数据 等数据库收录! |
|