| 关联规则挖掘中一种实视图选择策略 |
| |
| 引用本文： | 陈佳,李敏. 关联规则挖掘中一种实视图选择策略[J]. 计算机工程与应用, 2012, 48(24): 134-138 |
| |
| 作者姓名： | 陈佳 李敏 |
| |
| 作者单位： | 武汉纺织大学 数学与计算机学院，武汉 430073 |
| |
| 基金项目： | 湖北省教育厅中青年科技项目(No.20111613) |
| |
| 摘 要： | 关联规则挖掘是数据挖掘问题中一个典型任务。其挖掘响应时间是数据挖掘系统中重要的问题之一。为了高效解决这一问题，给出了关联规则实视图的概念以及相应的代价模型；提出了针对数据挖掘环境的实视图选择算法，以便在存储空间约束的条件下，取得较好的查询性能。实验结果表明，该算法能有效地选取实视图，从而大大提高关联规则挖掘算法的效率。
|
| 关 键 词： | 数据挖掘 视图选择 关联规则 |
Selection of materialized view in association rule mining |
| |
| CHEN Jia , LI Min. Selection of materialized view in association rule mining[J]. Computer Engineering and Applications, 2012, 48(24): 134-138 |
| |
| Authors: | CHEN Jia LI Min |
| |
| Affiliation: | School of Mathematics and Computer Science, Wuhan Textile University, Wuhan 430073, China |
| |
| 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. |
| |
| Keywords: | data mining view selection association rule |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
