|
|||||
|
|
| 基于Apriori的有效关联规则挖掘算法的研究 | |
| 引用本文： | 张梅峰,张建伟,张新敬,娄淑琴.基于Apriori的有效关联规则挖掘算法的研究[J].计算机工程与应用,2003,39(19):196-198. |
| 作者姓名： | 张梅峰 张建伟 张新敬 娄淑琴 |
| 作者单位： | 1. 郑州轻工业学院计算机科学与工程系,郑州,450002 2. 郑州轻工业学院数理系,郑州,450002 3. 北方交通大学电子信息工程学院,北京,100044 |
| 基金项目： | 河南省自然科学基金项目(编号:111070600) |
| 摘 要： | 通过对Apriori算法进行的分析与研究,发现其在实用中存在两个主要问题:生成的关联规则具有相当大的冗余性;有可能挖掘出一条支持度和置信度均很高,但却是无趣的、甚至是虚假的关联规则,且不能产生带有否定项的规则。鉴于此,该文给出了关联规则的两个性质和引入兴趣度的第三个度量———相关支持度,设计了挖掘出有效关联规则算法,较好地解决了上述问题。 |
| 关 键 词： | 数据挖掘 关联规则 Apriori 兴趣度 |
| 文章编号： | 1002-8331-(2003)19-0196-03 |
| 修稿时间： | 2002年8月1日 |
Research on an Algorithm for Mining of Efficient Association Rules Based on Apriori |
|
| Zhang Meifeng,Zhang Jianwei,Zhang Xinjing,Lou Shuqin.Research on an Algorithm for Mining of Efficient Association Rules Based on Apriori[J].Computer Engineering and Applications,2003,39(19):196-198. | |
| Authors: | Zhang Meifeng Zhang Jianwei Zhang Xinjing Lou Shuqin |
| Affiliation: | Zhang Meifeng 1 Zhang Jianwei 1 Zhang Xinjing 2 Lou Shuqin 31 |
| Abstract: | By analyzing and studying Apriori algorithm,this paper finds two problems.Firstly,generated association rules are quite redundant.Secondly,it is probable to find an association rule,which possess high support and confidence,but is uninteresting,and even is false.Furthermore,a rule with negative-item can't be produced.Thus,this paper,after giving the two properties of association rules and introducing interest measure's third threshold—correlation support,effective association rules are worked out and able to solve above problems well. |
| Keywords: | Data Mining Association Rule Apriori Interest Measure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
