首页> 外文会议>International Conference on Applications of Digital Information and Web Technologies >An Algorithm for Reusable Uninteresting Rules in Association Rule Mining
【24h】

An Algorithm for Reusable Uninteresting Rules in Association Rule Mining

机译:一种在关联规则挖掘中可重复使用的不合物规则算法

获取原文

摘要

In this paper, we present a new framework for reusable association rule mining based on X{sup}2 and odds ratio. We start at mining the association rules using standard Apri-ori algorithm. The strong rules are defined as association rules, while the weak rules will be evaluated by our proposed method. Firstly, the weak rules must be converted to 2 × 2 contingency table. We then compute the relationship between variables using X{sup}2 and odds ratio. If the weak rules are related to each other with positive or negative relationship, then the weak rules will also be determined as association rules. Our system is evaluated with experiments on the crime data.
机译:在本文中,我们为基于x {sup} 2和odds比率提供了一种可重用关联规则挖掘的新框架。我们从标准的APRI-ORI算法开始挖掘关联规则。强规则被定义为关联规则,而我们建议的方法将评估弱规则。首先,必须将弱规则转换为2×2次应急表。然后,我们使用x {sup} 2和odds比计算变量之间的关系。如果弱规则彼此彼此相关,则弱规则也将被确定为关联规则。我们的系统通过关于犯罪数据的实验进行评估。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号