| 关联规则的哈希修剪算法研究 |
| |
| 引用本文： | 朱小栋,郑诚,舒坚,陈振.关联规则的哈希修剪算法研究[J].安徽大学学报(自然科学版),2005,29(4):20-23. |
| |
| 作者姓名： | 朱小栋 郑诚 舒坚 陈振 |
| |
| 作者单位： | 安徽大学,计算机科学与技术学院,安徽,合肥,230039;安徽大学,计算中心,安徽,合肥,230039 |
| |
| 基金项目： | 安徽省教育厅自然科学基金;2002kj009; |
| |
| 摘 要： | 关联规则是数据挖掘的一个基本方法,本文首先介绍传统的Apriori算法的过程,分析它在处理大数据集时存在的问题.提出关联规则的一种改进算法,称为哈希修剪算法.然后比较改进的算法与传统的Apriori算法在算法时间复杂度、性能上的差异.通过实验得出,哈希修剪算法在数据挖掘中能够更加有效的处理数据.
|
| 关 键 词： | 关联规则 数据挖掘 哈希修剪 |
| 文章编号： | 1000-2162(2005)04-0020-04 |
Research on hash pruning algorithm of association rules |
| |
| ZHU Xiao-dong,Zheng Cheng,SHU Jian,CHEN Zhen.Research on hash pruning algorithm of association rules[J].Journal of Anhui University(Natural Sciences),2005,29(4):20-23. |
| |
| Authors: | ZHU Xiao-dong Zheng Cheng SHU Jian CHEN Zhen |
| |
| Institution: | ZHU Xiao-dong1,ZHENG Cheng1,SHU Jian2,CHEN Zhen 1 |
| |
| Abstract: | Association rule is a basic method of data mining, this paper first introduces the process of traditional Apriori algorithm,analysizes its problems on processing big data set.Then an improved algorithm which named Hash Pruning algorithm is proposed.In this paper,we discuss the difference on temporal complexity and compacity between the improved algorithm and the traditonal Apriori algorithm.The experiment shows the improved Algorithm proposed in this paper can efficiently,accurately and quickly mining association rules from big data set. |
| |
| Keywords: | association rule data mining hash pruning |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
