首页> 外文会议>2012 7th international conference on computer science amp; education >An improved association rule algorithm based on Itemset Matrix and Cluster Matrix
【24h】

An improved association rule algorithm based on Itemset Matrix and Cluster Matrix

机译:基于项目集矩阵和聚类矩阵的改进关联规则算法

获取原文
获取原文并翻译 | 示例

摘要

Through the analysis of the method of association rules, an improved algorithm in association rules based on Itemset Matrix(ISM) and Cluster Matrix(CMa) is put forward. The algorithm can get the new frequent itemsets just through scanning the updated data once again, when the database and the minimum support degree are changed. Studies and analysis of the algorithm show that it just need to scan the database once, so it has the virtues in high-speed producing frequent k-itemsets and less time cost. And it improves the efficiency of the association mining, can fulfill the request of shortening the time of mining.
机译:通过对关联规则方法的分析,提出了一种基于项集矩阵(ISM)和聚类矩阵(CMa)的关联规则改进算法。当数据库和最小支持度发生变化时,该算法只需再次扫描更新的数据即可获得新的频繁项集。对算法的研究和分析表明,该算法只需要扫描一次数据库,具有高速生成频繁的k项集和减少时间成本的优点。并且提高了联合开采的效率,可以满足缩短开采时间的要求。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号