...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Knowledge and Data Engineering >Probabilistic Static Load-Balancing of Parallel Mining of Frequent Sequences
【24h】

Probabilistic Static Load-Balancing of Parallel Mining of Frequent Sequences

机译：频繁序列并行挖掘的概率静态负载均衡

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

获取外文期刊封面封底 >>

       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Frequent sequence mining is well known and well studied problem in datamining. The output of the algorithm is used in many other areas like bioinformatics, chemistry, and market basket analysis. Unfortunately, the frequent sequence mining is computationally quite expensive. In this paper, we present a novel parallel algorithm for mining of frequent sequences based on a static load-balancing. The static load-balancing is done by measuring the computational time using a probabilistic algorithm. For reasonable size of instance, the algorithms achieve speedups up to where is the number of processors. In the experimental evaluation, we show that our method performs significantly better then the current state-of-the-art methods. The presented approach is very universal: it can be used for static load-balancing of other pattern mining algorithms such as itemset/tree/graph mining algorithms.
机译：频繁的序列挖掘是数据挖掘中众所周知的且研究充分的问题。该算法的输出还用于许多其他领域，例如生物信息学，化学和市场分析。不幸的是，频繁的序列挖掘在计算上非常昂贵。在本文中，我们提出了一种基于静态负载平衡的频繁序列挖掘新并行算法。静态负载平衡是通过使用概率算法测量计算时间来完成的。对于合理大小的实例，算法可实现高达处理器数量的加速。在实验评估中，我们证明了我们的方法比当前的最新技术具有更好的性能。提出的方法非常通用：可用于其他模式挖掘算法（例如项集/树/图挖掘算法）的静态负载平衡。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号