加权关联规则挖掘的算法研究  

The Research of Weighted Association Rules Algorithm

作　　者：赵园园[1] 姜合[1] 孙宝友[1] ZHAO Yuan-yuan,JIANG He,SUN Bao-you（Information Science and Technology College Shandong Institute of Light Industry, Ji＇nan 250353,China）

机构地区：[1]山东轻工业学院信息科学与技术学院,山东济南250353

出　　处：《电脑知识与技术》2007年第11期663-665,共3页Computer Knowledge and Technology

摘　　要：信息时代的到来，产生了大量的数据。在大量的数据背后隐藏着许多重要的信息，如果能把这些信息从数据库中抽取出来，将会创造很多潜在的利润。关联规则的挖掘已被广泛应用在实际生活中。但过去的研究往往认为数据库各个项目的重要程度是相同的，而事实上，用户对项目的看重程度是不同的，因此已有算法挖掘出来的并不一定是我们感兴趣的规则。针对这种情况．提出了加权关联规则。A lot of data is created because of the coming of the information age. There are a lot of important information in the data, the potential profit will be created if the information is extracted form the data. Minging association rules have many wide applications in some fields. The researches in the past treat th e importance of each item as uniformity. But in the fact, the importance of the items to the user is different, so all the rules mined by these proposed algorithms are not those we are interest- ed in. The weighted association rules are proposed to solve the above problem.

关 键 词：数据挖掘 关联规则 加权 算法 

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