冗余关联规则删减技术研究综述  

The survey of non-redundant association rules research

作　　者：杨越越[1] 董祥军[1] 翟延富[1] 

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

出　　处：《山东轻工业学院学报（自然科学版）》2007年第4期31-33,共3页Journal of Shandong Polytechnic University

摘　　要：关联规则是数据挖掘的重要研究内容之一,而传统算法生成的关联规则之间存在着大量的冗余规则,这使得用户分析和利用这些规则变得十分困难。为了帮助用户分析,可以采用各种技术来有效地减少大量冗余的规则。本文介绍了冗余关联规则的概念,冗余关联规则删减的算法,结合当前的研究成果分析冗余关联规则的发展趋势。The discovery of association rules is an important research topic in data mining, but the traditional association rules discovery algorithm produces too many redundant rules, which makes it difficult for users to analyze and makes use of these rules. To facilitate analysis, the number of redundant rules can be reduced sig- nificantly by techniques. This paper introduces the concept of redundant rules and the non-redundant rules al- gorithm, analyzes developing directions of redundant rules using currently research fruit.

关 键 词：数据挖掘 关联规则 频繁项集 冗余性 

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