基于Apriori有效关联规则及其兴趣度的研究
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

tp301

基金项目:


Research On The Algorithm Of Efficient Association Rules Base On Apriori And Interestingness Research
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    通过对Apriori算法进行的分析与研究,发现其在实用中存在两个主要问题:生成的关联规则具有相当大的冗余性;有可能挖掘出一条支持度和置信度均很高,但却是无趣的、甚至是虚假的关联规则,且不能产生带有否定项的规则。鉴于此,该文给出了关联规则的两个性质和引入兴趣度的第三个度量——相关支持度,利用两个性质消除了一定的冗余,同时利用相关支持度使挖掘出的规则更符合用户的需求,设计了挖掘出有效关联规则算法,在算法中利用导出的性质提高算法效率,较好地解决了上述问题。

    Abstract:

    By analyzing and study Apriori algorithm, this paper finds two main problem in the practical use: Firstly generating quite a lot of redundancy association rules; Secondly, it maybe mine an association rule that possess high support and confidence, but it’s uninteresting and even it is false. Furthermore, it can’t generate a rule with negative item. Thus, this paper bring two properties of the association rules and introduce the third interesting measure’s threshold ---correlation support measure,by use of the properties, it can diminish some redundancy, at the same time we can use the correlation support measure to mine those rules which are more interesting and it design a efficiency algorithm and by the use of induce two properties to raise efficiency in the algorithm to resolve the above shortcoming well.

    参考文献
    相似文献
    引证文献
引用本文

常少春. 基于Apriori有效关联规则及其兴趣度的研究[J]. 科学技术与工程, 2010, (28): .
changshaochun. Research On The Algorithm Of Efficient Association Rules Base On Apriori And Interestingness Research[J]. Science Technology and Engineering,2010,(28).

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2010-06-23
  • 最后修改日期:2010-07-27
  • 录用日期:2010-07-19
  • 在线发布日期: 2010-09-01
  • 出版日期:
×
律回春渐,新元肇启|《科学技术与工程》编辑部恭祝新岁!
亟待确认版面费归属稿件,敬请作者关注