首页> 外文会议>International conference on innovation and information management >Efficient IUA-FP Approach for Utility Pattern Mining
【24h】

Efficient IUA-FP Approach for Utility Pattern Mining

机译:高效的IUA-FP方法用于实用模式挖掘

获取原文

摘要

Traditional methods of association rule mining consider the appearance of an item in a transaction, whether or not it is purchased, as a binary variable. But, the quantity of an item purchased by the customers may be more than one, and the unit cost may not be the same for all items. Utility mining is a generalized form of the share mining model introduced to overcome the mentioned problem. Developing an efficient algorithm is vital for utility mining because high utility itemsets cannot be identified by the pruning strategy. In this paper, an efficient approach is proposed for utility pattern mining with the aid of FP-growth algorithm. The efficiency of utility pattern mining is achieved with incorporating the utility values after mining the frequent patterns (IUA-FP). Here, the patterns that are mined from the FP-growth algorithm are utilized to generate high utility patterns using internal and external utility. Experimentation is carried out on using Retail dataset, a real market basket datasets. The proposed approach generated less number of frequent patterns compared to the FP-growth algorithm in literature and also provided much similar results only for the utility threshold. Hence, the performance study shows that the proposed approach is efficient in mining high utility patterns.
机译:传统的关联方法规则挖掘考虑事务中的项目的外观,无论是购买的,是否都是二进制变量。但是,由客户购买的物品的数量可能是多于一个,并且所有物品的单位成本可能都不相同。公用事业挖掘是普遍形式的股票挖掘模型,以克服提到的问题。开发有效的算法对于公用事业挖掘至关重要,因为灌注策略无法识别高实用项目集。本文提出了一种有效的方法,用于借助于FP-生长算法的实用模式挖掘。在挖掘频繁模式(IUA-FP)后结合效用值,实现了效用模式挖掘的效率。这里,利用从FP-生长算法中开采的模式来使用内部和外部实用程序生成高实用图案。实验是在使用零售数据集,真正的市场篮子数据集进行的。与文献中的FP-生长算法相比,所提出的方法产生了较少数量的频繁模式,并且还提供了与实用阈值相似的结果。因此,性能研究表明,采矿高效用模式的拟议方法是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号