首页> 外文会议>Fifth International Conference on Internet Computing for Science and Engineering >Research on Mining Positive and Negative Association Rules Based on Dual Confidence
【24h】

Research on Mining Positive and Negative Association Rules Based on Dual Confidence

机译:基于双重置信度的正负关联规则挖掘研究

获取原文

摘要

Mining of association rules has become an important area in the research on data mining. However the traditional approaches based on support-confidence framework maybe generate a great number of redundant and wrong association rules. In order to solve the problems, a correlation measure is defined and added to the mining algorithm for association rules. According to the value of correlation measure, association rules are classified into positive and negative association rules. Therefore, the new algorithm can mine the negative-item-contained rules. In the paper, the algorithm which based on the correlation and dual confidence, can mine the positive and negative association rules. The experimental result shows that positive and negative association rules mining algorithm can reduce the scale of meaningless association rules, and mine a lot of interesting negative association rules.
机译:关联规则的挖掘已经成为数据挖掘研究的重要领域。然而,基于支持-信任框架的传统方法可能会产生大量的冗余和错误的关联规则。为了解决这些问题,定义了一种相关度量并将其添加到关联规则的挖掘算法中。根据关联度量的值,将关联规则分为正关联规则和负关联规则。因此,新算法可以挖掘出包含否定项目的规则。该文基于相关性和对偶置信度,可以挖掘正负关联规则。实验结果表明,正负关联规则挖掘算法可以减小无意义的关联规则的规模,并挖掘出许多有趣的负关联规则。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号