| 关联规则提取中对Apriori算法的一种改进 |
| |
| 引用本文： | 王创新. 关联规则提取中对Apriori算法的一种改进[J]. 计算机工程与应用, 2004, 40(34): 183-185 |
| |
| 作者姓名： | 王创新 |
| |
| 作者单位： | 长沙理工大学电气与信息学院,长沙,410076 |
| |
| 摘 要： | 关联规则的提取是数据挖掘中的重要研究课题,该文对关联规则提取中的Apriori算法进行了深入研究,指出了该算法的某些不足,提出了一种改进算法。实验结果表明,该算法性能明显优于Apriori算法,具有较高的推广价值。
|
| 关 键 词： | 数据挖掘 关联规则 频繁项目集 |
| 文章编号： | 1002-8331-(2004)34-0183-03 |
An Improved Apriori Algorithm for Mining Association Rules |
| |
| Wang Chuangxin. An Improved Apriori Algorithm for Mining Association Rules[J]. Computer Engineering and Applications, 2004, 40(34): 183-185 |
| |
| Authors: | Wang Chuangxin |
| |
| Abstract: | Mining association rules is an important topic in the data mining research field.The Apriori algorithm in mining association rules are carefully studied in this paper.The writer researches into the Apriori algorithm and presents an improved algorithm.The experiment results of the algorithm show that the improved algorithm has an outstanding performance over the original and high value to be popularized. |
| |
| Keywords: | data mining association rules frequent itemsets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
