计算机工程 ›› 2010, Vol. 36 ›› Issue (7): 55-57.doi: 10.3969/j.issn.1000-3428.2010.07.019

• 软件技术与数据库 • 上一篇    下一篇

一种改进的加权关联规则挖掘方法

李成军,杨天奇   

  1. (暨南大学信息科学技术学院计算机系,广州 510632)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-04-05 发布日期:2010-04-05

Improved Weighted Association Rules Mining Method

LI Cheng-jun, YANG Tian-qi   

  1. (Department of Computer, College of Information Science and Technology, Jinan University, Guangzhou 510632)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-04-05 Published:2010-04-05

摘要: 考虑属性数量和属性权值对关联规则的影响,提出一种新的加权支持度和加权置信度计算方法,在挖掘加权关联规则时通过改进加权支持度设置模型保持Apriori算法的频繁集向下封闭特性。与Apriori算法和水平加权关联规则挖掘方法的比较结果证明该方法能快速有效地挖掘重要的关联规则。

关键词: 加权关联规则, 加权支持度, 频繁项集

Abstract: Considering the impact of the property number and weight on association rules, this paper presents a new method for mining weighted association rules, which can hold the downward closed property by using an improved model of weighted support measurements when mining association rules. Compared with Apriori algorithm and horizontal weighted association rules mining method, it proves that the method can quickly and efficiently mine important association rules.

Key words: weighted association rule, weighted support, frequent itemset

中图分类号: