首页> 外文会议>Web information systems and mining >Research and Improvement on Association Rule Algorithm Based on FP-Growth
【24h】

Research and Improvement on Association Rule Algorithm Based on FP-Growth

机译:基于FP-Growth的关联规则算法的研究与改进

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

摘要

Association rules mining (ARM) is one of the most useful techniques in the field of knowledge discovery and data mining and so on. Frequent item sets mining plays an important role in association rules mining. Apriori algorithm and FP-growth algorithm are famous algorithms to find frequent item sets. Based on analyzing on an association rule mining algorithm, a new association rule mining algorithm, called HSP-growth algorithm, is presented to generate the simplest frequent item sets and mine association rules from the sets. HSP-growth algorithm uses Huffman tree to describe frequent item sets. The basic idea and process of the algorithm are described and how to affects association rule mining is discussed. The performance study and the experimental results show that the HSP-growth algorithm has higher mining efficiency in execution time and is more efficient than Apriori algorithm and FP-growth algorithm.
机译:关联规则挖掘(ARM)是知识发现和数据挖掘等领域中最有用的技术之一。频繁项集挖掘在关联规则挖掘中起着重要作用。 Apriori算法和FP-growth算法是找到频繁项集的著名算法。在分析关联规则挖掘算法的基础上,提出了一种新的关联规则挖掘算法,称为HSP-growth算法,用于生成最简单的频繁项目集和从集合中挖掘关联规则。 HSP增长算法使用霍夫曼树描述频繁项集。描述了该算法的基本思想和过程,并讨论了如何影响关联规则挖掘。性能研究和实验结果表明,HSP-growth算法在执行时间上具有较高的挖掘效率,并且比Apriori算法和FP-growth算法效率更高。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号