数据挖掘中关联规则算法的研究  

Research on Algorithms for the Association Rules in Data Mining

作　　者：程玉[1] 熊英[1] 

机构地区：[1]湖北工业大学计算机学院,湖北武汉430068

出　　处：《软件导刊》2009年第11期63-65,共3页Software Guide

摘　　要：Apriori算法是关联规则挖掘中的经典算法。通过对Apriori算法的基本思想和性能的研究分析,提出了一种基于垂直事务列表的树形结构的挖掘算法,减少了候选频繁项集的数量,提高了挖掘算法的效率。实验结果表明新算法具有良好的性能。Mining association rule is an important task in data mining research field ,its purpose is to mine interesting associations in transaction database. Apriori algorithm is a classical algorithm traditional association rule. Based on the study of principle and efficiency of the Apriori algorithm,in this paper it points out a tree structure algorithm based vertical tidist to resolve the frequent itemsets proposes in Apriori, and improve the efficiency of mining algorithm, It reduces the number of alternatives and improve the efficiency of mining algorithm.Experimental results show it has a good performance.

关 键 词：数据挖掘 关联规则 APRIORI算法 频繁项集 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]