Abstract: Association rule mining is one of the classic data mining problems. The basic problem in data mining is the processing time of data mining queries. To address this problem efficiently, the notion and cost model of an association rule mining materialized view are presented. The algorithms which aim at efficient select materialized views are proposed. The experimental results demonstrate the effectiveness and show that using a set of materialized view is an efficient solution.

Key words: data mining, view selection, association rule

摘要： 关联规则挖掘是数据挖掘问题中一个典型任务。其挖掘响应时间是数据挖掘系统中重要的问题之一。为了高效解决这一问题，给出了关联规则实视图的概念以及相应的代价模型；提出了针对数据挖掘环境的实视图选择算法，以便在存储空间约束的条件下，取得较好的查询性能。实验结果表明，该算法能有效地选取实视图，从而大大提高关联规则挖掘算法的效率。

关键词: 数据挖掘, 视图选择, 关联规则