| 基于两次剪枝的完全加权关联规则挖掘算法 |
| |
| 引用本文： | 黄名选,严小卫,张师超.基于两次剪枝的完全加权关联规则挖掘算法[J].情报理论与实践,2008,31(1):137-140,36. |
| |
| 作者姓名： | 黄名选 严小卫 张师超 |
| |
| 作者单位： | 1. 广西教育学院,数学与计算机科学系,广西,南宁,530023;广西师范大学,计算机学院,广西,桂林,541004
2. 广西师范大学,计算机学院,广西,桂林,541004;悉尼理工大学,信息技术学院,澳大利亚,悉尼 |
| |
| 摘 要： | 完全加权关联规则挖掘在信息检索查询扩展领域中有着很高的应用价值.在深入研究现有算法的基础上,提出基于两次剪枝的完全加权关联规则的挖掘算法,给出与其相关的定理,进行相应的实验.该算法采用两次剪枝策略,候选项集数量和挖掘时间明显减少,挖掘效率得到提高.实验结果表明了该算法的有效性,与现有算法比较,挖掘效率确实得到改善.
|
| 关 键 词： | 关联规则 数据挖掘 算法 |
| 收稿时间： | 2007-07-06 |
| 修稿时间： | 2007年7月6日 |
All-Weighted Association Rules Mining Algorithm Based on Double Pruning Strategy |
| |
| Huang Mingxuan et al..All-Weighted Association Rules Mining Algorithm Based on Double Pruning Strategy[J].Information Studies:Theory & Application,2008,31(1):137-140,36. |
| |
| Authors: | Huang Mingxuan |
| |
| Abstract: | All-weighted association rules mining has high application value in information retrieval and query expansion. After a deep study of the existing algorithm, this paper proposes an all-weighted association rules mining algorithm based on double pruning strategy, gives the related theorems and conducts some relevant experiments. Using the double pruning strategy in the algorithm, the number of the candidate item set and the average execution times are obviously reduced, and the mining efficiency is improved. The experimental result proves the validity of the algorithm, and compared with the existing algorithm, the mining efficiency is truly improved. |
| |
| Keywords: | association rules data mining algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
