首页> 外文会议>2011 International Conference on E-Business and E-Government >Mining weighted association rules based on weighted Fp tree
【24h】

Mining weighted association rules based on weighted Fp tree

机译:基于加权Fp树的加权关联规则挖掘

获取原文

摘要

The article presents a new algorithm for mining weighted frequent itemsets without generating candidate, which based on weighted Fp-tree and the weighted model proposed by Feng Tao. For solving the problem that the weighed support may be bigger than 1, the weight set of attributes was normalized. The new algorithm is testified to satisfy weighted downward closure property and an effectively mining pruning strategy base of weighed Fp-tree is structured. Thorough research and scientific analysis, the new algorithm solves the problem that the importance of association rule does not increase with the amount of attribute in practical application.
机译:本文提出了一种基于加权Fp树和冯涛提出的加权模型的加权频繁项集挖掘算法,无需生成候选项。为了解决称重支撑可能大于1的问题,对属性的权重集进行了归一化。经过验证,该新算法满足加权向下封闭性,构造了加权Fp树的有效挖掘修剪策略库。经过深入的研究和科学分析,新算法解决了关联规则的重要性在实际应用中不随属性数量的增加而增加的问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号