摘要
在数据库中发现频繁模式和关联规则是数据挖掘领域的最基本、最重要的问题。自从Agrawal的开创性工作以来,有关研究从未停止过。然而由于其内在的计算复杂性,这一问题并未完全解决。本文对关联规则的基本概念和类型、重要挖掘算法、特别是近年来相关研究的新进展做了全面综述与深入分析,并指出了未来的研究方向。
This paper discusses the discovery of frequent pattern and association rules in databases , which is the most fundamental and important problem in data mining area. Since the pioneering work of Agrawal, there has been an increase of research interest in this problem. Yet. it is not fully addressed because of the inherent computational complexity. We present an overview of the different kinds of algorithms and new developments of research in this area, and discuss the future direction of the research.
出处
《计算机科学》
CSCD
北大核心
2004年第1期110-113,共4页
Computer Science
基金
浙江省自然科学基金(GJ0302)
浙江省教育厅科技计划(20020635)
关键词
数据库
关联规则
数据挖掘
可信度
频集
Knowledge discovery. Data mining, Frequent patterns, Association rules, Survery