...
首页> 外文期刊>Journal of computer information systems >A NEW DATA STREAM MINING ALGORITHM FOR INTERESTINGNESS-RICH ASSOCIATION RULES
【24h】

A NEW DATA STREAM MINING ALGORITHM FOR INTERESTINGNESS-RICH ASSOCIATION RULES

机译:有趣的,丰富的关联规则的新数据流挖掘算法

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

摘要

Frequent itemset mining and association rule generation is a challenging task in data stream. Even though, various algorithms have been proposed to solve the issue, it has been found out that only frequency does not decides the significance interestingness of the mined itemset and hence the association rules. This accelerates the algorithms to mine the association rules based on utility i.e. proficiency of the mined rules. However, fewer algorithms exist in the literature to deal with the utility as most of them deals with reducing the complexity in frequent itemset/association rules mining algorithm. Also, those few algorithms consider only the overall utility of the association rules and not the consistency of the rules throughout a defined number of periods. To solve this issue, in this paper, an enhanced association rule mining algorithm is proposed. The algorithm introduces new weightage validation in the conventional association rule mining algorithms to validate the utility and its consistency in the mined association rules. The utility is validated by the integrated calculation of the cost/price efficiency of the itemsets and its frequency. The consistency validation is performed at every defined number of windows using the probability distribution function, assuming that the weights are normally distributed. Hence, validated and the obtained rules are frequent and utility efficient and their interestingness are distributed throughout the entire time period. The algorithm is implemented and the resultant rules are compared against the rules that can be obtained from conventional mining algorithms.
机译:频繁的项目集挖掘和关联规则生成是数据流中的一项艰巨任务。尽管已经提出了各种算法来解决该问题,但是已经发现,只有频率不能决定所挖掘项目集的重要性,从而不能决定关联规则。这加速了基于效用即挖掘规则的熟练程度来挖掘关联规则的算法。但是,文献中很少有算法可以处理该实用程序,因为它们大多数用于减少频繁项集/关联规则挖掘算法的复杂性。而且,这几种算法仅考虑关联规则的整体效用,而不考虑整个定义数量的周期内规则的一致性。为了解决这个问题,本文提出了一种增强的关联规则挖掘算法。该算法在常规的关联规则挖掘算法中引入了新的权重验证,以验证效用及其在所关联规则中的一致性。通过对项目集的成本/价格效率及其频率进行综合计算,可以验证效用。假设权重是正态分布的,则使用概率分布函数在每个定义的窗口数处执行一致性验证。因此,经过验证和获得的规则是频繁且实用的,它们的趣味性分布在整个时间段内。该算法已实现,并将生成的规则与可以从常规挖掘算法获得的规则进行比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号