首页> 外文会议>International Conference on Frontiers of Intelligent Computing : Theory and Applications >Mining and Ranking Association Rules in Support, Confidence, Correlation, and Dissociation Framework
【24h】

Mining and Ranking Association Rules in Support, Confidence, Correlation, and Dissociation Framework

机译:挖掘和排名关联规则以支持,信心,相关和解离框架

获取原文

摘要

Existing methods in association rule mining based on traditional support-confidence framework generates huge number of frequent patterns and association rules often ignoring the dissociation among items. Moreover these procedures are unable to order the rules by comparing them to find which one is better than whom. We have introduced a new algorithm for mining frequent patterns based on support and dissociation and thereafter generating rules based on confidence and correlation. The association rules have been ranked based on a composite index computed from the four measures. The experimental results obtained after implementation of the proposed algorithm justify our approach.
机译:基于传统支持信心框架的关联规则挖掘现有方法产生了大量的频繁模式和关联规则,通常忽略物品之间的解离。此外,这些程序无法通过比较它们找到哪一个比谁更好地订购规则。我们已经基于支持和解离以及基于置信和相关性产生规则,推出了一种新的频繁模式算法。关联规则已经基于从四种测量计算的复合指数进行排序。在实施建议算法后获得的实验结果证明了我们的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号