摘要
在大型数据库项目之间发现关联规则是一个重要的数据挖掘问题,而挖掘出的关联规则数目常常是巨大的。文中介绍了简单关联规则和原关联规则的概念,而传统算法挖掘出的关联规则集中的任何规则,均可以由原关联规则导出,并且原关联规则的数目远远小于传统算法挖掘出的关联规则数目。对简单关联规则和原关联规则进行了分析比较,给出了挖掘原关联规则算法,并举例说明算法的执行过程。
Diseovering association rules between items in a large database is an important data mining problem. The number of association rules is usually very large. So introduces the ooncepts of simple association rules and the original association rules,all rules in the rules set mined by conventional mining algorithms can be generated by the original association rules. Moreover, the number of the original association rules is much less than the numnber of all rules. Here analyzes tow association rules, and gives the original association rules algorithm and an example shows the operational proeess of the algorithm.
出处
《微机发展》
2005年第10期35-38,共4页
Microcomputer Development
基金
广东省科技攻关资助项目(C10201A1020103)