一种新的关联规则挖掘思想  

Mining Association Rules in Record-weighted Data Source

作　　者：江卓军[1] 谢康林 张文杰[1] 

机构地区：[1]上海交通大学计算机科学与工程系,上海200030

出　　处：《计算机工程》2002年第4期88-90,129,共4页Computer Engineering

摘　　要：提出的新的关联规则挖掘思想(以下称为“记录加权型关联规则挖掘”)是为每一条历史记录加上相应的权重值,以反映“不同记录对挖掘结果贡献不同”这一数据挖掘的实际要求。在此基础上,还对支持度、可信度和挖掘算法作了相应的修正,提出了RWA priori-Tid算法。The new idea named mining association rules in record-weighted data source, which is presented in this paper, tends to add a weight to each record so as to meet the requirement which calls for different contributions to the association rules in different records. Basing on such a consideration, we have modified the definition of the support and the confidence as well as revised the mining algorithm to raise a new algorithm named RWApriori-Tid.

关 键 词：数据挖掘 关联规则 加权 PWApriori-Tid算法 数据库 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]