【24h】

Algorithms for Mining Share Frequent Itemsets Containing Infrequent Subsets

机译:包含不频繁子集的共享频繁项目集的挖掘算法

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

摘要

The share measure for itemsets provides useful information about numerical values associated with transaction items, that the support measure cannot. Finding share frequent itemsets is difficult because share frequency is not downward closed when it is defined in terms of the itemset as a whole. The Item Add-back and Combine All Counted algorithms do not rely on downward closure and thus, are able to find share frequent itemsets that have infrequent subsets. These heuristic algorithms predict which itemsets should be counted in the current pass using information available at no additional processing cost.
机译:项目集的共享度量提供有关与交易项目关联的数值的有用信息,而支持度量则不能。查找共享频繁项集很困难,因为从整体上定义共享集时,共享频率不会向下关闭。项目加回和合并所有计数算法不依赖于向下闭合,因此能够找到具有不频繁子集的共享频繁项目集。这些启发式算法使用无需额外处理成本即可获得的信息来预测当前通过中应计入哪些项目集。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号