摘要: 关联规则是数据挖掘最重要的课题之一。该文简单回顾了挖掘关联规则问题,提出了一种基于较小超集的高效的关联规则挖掘算法,该算法仅须对数据库作三次遍历,实现方便,提高了效率。
关键词:
关联规则,
频繁模式集,
超集,
父模式,
子模式
Abstract: Association rule is one of the most important topics of the data mining research. This paper reviews the problem of mining association rules and presents an efficient algorithom for mining association rules on the basis of small candidate itemset. It scans the database only three times. It can be easily implemented, and improves the efficiency greatly.
中图分类号:
郭景峰,路燕. 基于小超集的关联规则快速挖掘算法[J]. , 2000, 26(12): 40-41.
GUO Jingfeng, LU Yan. An Efficient Algorithem for Association Rules Based on Small Candidate Itemset[J]. , 2000, 26(12): 40-41.