加权关联规则的并行挖掘算法  

A Parallel Algorithm for Mining Weighted Association Rules in Database

作　　者：杨泽民[1] 陈莉[1] 范全润 

机构地区：[1]西北大学计算机科学系

出　　处：《计算机工程与应用》2003年第8期192-193,共2页Computer Engineering and Applications

基　　金：陕西省自然科学基金项目(编号:98×11);陕西省教委重点科研计划项目

摘　　要：关联规则是数据挖掘的重要研究内容之一,而传统的算法均为串行算法且将数据库项目按平等一致方式加以处理。文章提出了加权关联规则的并行挖掘算法,探讨了相关的数据结构,并对算法进行了定性分析。The discovery of association rules is an important research topic in data mining,but the traditional associa-tion rules discovery algorithms are all serial association rules discovery algorithms and treat items in a databases in a uniform way.This paper presents a parallel algorithm of weighted association rules to avoid the defect and the relevant data structure as well as a qualitative analysis on the algorithm is also given.The experiments demonstrate that the par-allel algorithm of weighted association rules is effective and efficient.

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

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