首页> 外文会议>International Conference on Advanced Computing and Communicaitons >Efficient Mining of Top-K Strongly Correlated Item Pairs using One Pass Technique
【24h】

Efficient Mining of Top-K Strongly Correlated Item Pairs using One Pass Technique

机译:使用一种通过技术的高效挖掘Top-K强烈相关项目对

获取原文

摘要

This paper presents an efficient one pass technique, k-SCOPE (Top k Strongly Correlated item Pair Extraction), which finds top-k strongly correlated item pairs from transaction database, without generating any candidate sets. The proposed technique uses a correlogram matrix based approach to compute support count of all the 1- and 2-itemset in a single scan over the database. From the correlogram matrix the correlation values of all the item pairs are computed and top-k correlated pairs are extracted very easily. The simplified logic structure makes the implementation of the proposed technique more attractive. We experimented with real and synthetic datasets and compared the performance of the proposed technique with its other counterparts and found satisfactory.
机译:本文呈现了一种有效的一种传递技术,K范围(顶部K强相关的项目对提取),它从事务数据库中找到Top-K强烈相关的项目对,而不产生任何候选集。所提出的技术使用基于相关的基于矩阵的方法来计算在数据库上的单次扫描中的所有1和2项集的支持计数。根据相关性矩阵,计算所有项目对的相关值,并且非常容易提取顶-k相关对。简化的逻辑结构使得实施提出的技术更具吸引力。我们尝试了实际和合成的数据集,并将提出的技术与其它对应物进行了比较,发现令人满意。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号