首页> 外文会议>International Symposium on Pervasive Systems, Algorithms, and Networks >An Incremental Mining Algorithm for High Average-Utility Itemsets
【24h】

An Incremental Mining Algorithm for High Average-Utility Itemsets

机译:高平均实用程序项集的增量挖掘算法

获取原文

摘要

The average utility measure reveals a better utility effect of combining several items than the original utility measure. In this paper, we propose a two-phase average-utility mining algorithm that can incrementally maintain the high average-utility itemsets as a database grows. Based on the concept of the FUP algorithm, the proposed algorithm combines the previously mined information from the original database and the new mined results from the newly inserted transactions to speed up the mining process. Experimental results also show the effectiveness and efficiency of the proposed algorithm.
机译:平均实用措施揭示了与原始实用程序相结合的更好的实用效果。在本文中,我们提出了一种两相平均实用程序挖掘算法,可以随着数据库的增长逐步逐步维护高平均实用程序项集。基于FUP算法的概念,所提出的算法将先前挖掘的信息与新插入的事务从原始数据库中的新挖掘信息组合起来,以加快挖掘过程。实验结果还显示了所提出的算法的有效性和效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号