计算机科学 ›› 2011, Vol. 38 ›› Issue (12): 191-193.

• 数据库与数据挖掘 • 上一篇    下一篇

一种改进的正负关联规则挖掘算法

陈宁军,高志年   

  1. (南京陆军指挥学院作战实验中心 南京210045);(南京陆军指挥学院研究生三队 南京210045)
  • 出版日期:2018-12-01 发布日期:2018-12-01

Improved Positive and Negative Association Rules Mining Algorithm

  • Online:2018-12-01 Published:2018-12-01

摘要: 针对传统正负关联规则挖掘算法需要多次扫描数据库并且生成大量候选频繁项集的问题,在对比目前相关研究成果的基础上,提出了一种改进的正负关联规则挖掘算法,它通过两次数据扫描完成对正负关联规则的挖掘,对最大频繁项集的挖掘算法做了改进,有效提高了算法效率,同时对置信度标准做了改进。基于某真实事务集的实验表明,算法提高了规则挖掘的质量和有效性。

关键词: 正负关联规则,关联规则挖掘,最大频繁项集,置信差

Abstract: Aiming at the problems of the traditional positive and negative association rules, such as multi-scanning database and generating large candidate frectuent itemset,on the basis of comparing recent research on association rules mining,put forward an improved positive and negative association rules mining algorithm, which can accomplish mining positive and negative association rules by scanning Dataset twice;and improve the algorithm of mining the maximal frequcnt itemset, which result in upgrading the efficiency of the algorithm; besides, improve the standard of confidence level,in order to increase the quality of association rules mining.

Key words: Positive and negative association rules,Association rules mining,Maximal frequent itemset,D-value of confidence level

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!