| 二项集剪枝技术研究 |
| |
| 引用本文： | 黄建业,苏毅娟. 二项集剪枝技术研究[J]. 广西师范学院学报(自然科学版), 2006, 23(1): 59-62 |
| |
| 作者姓名： | 黄建业 苏毅娟 |
| |
| 作者单位： | 广西师范大学,计算机系,广西,桂林,541004;广西师范学院,数学与计算机科学系,广西,南宁,530001 |
| |
| 摘 要： | 在现有的关联规则算法的基础上,深入分析了经典算法的内涵,提出了剪枝候选二项集的改进算法,有效的控制候选二项集的生成,得到传统算法中部分候选二项集,从而减少扫描数据库的运算量.与Apriori算法相比,效率明显提高.
|
| 关 键 词： | 二项集 剪枝技术 研究 |
| 文章编号： | 1002-8743（2006）01-0059-04 |
| 收稿时间： | 2005-11-12 |
| 修稿时间： | 2005-11-12 |
On Algorithm Pruning of Candidate 2-Itemsets |
| |
| HUANG Jian-ye,SU Yi-juan. On Algorithm Pruning of Candidate 2-Itemsets[J]. Journal of Guangxi Teachers Education University:Natural Science Edition, 2006, 23(1): 59-62 |
| |
| Authors: | HUANG Jian-ye SU Yi-juan |
| |
| Affiliation: | 1. Department of Computer Science, Guangxi Normal University, Guilin 541004; 2. Department of Mathematic and Computer Science Guangxi Teachers Education University, Nanning 530001 |
| |
| Abstract: | Based on the existing algorithm for association rules,this paper analyzes the application of the classical algorithm,presents the algorithm pruning the candidate 2-itemsets,effectively controls the candidate sum of 2-itemsets and only obtains the part number of 2-itemsets instead of the whole in the course of tradition mining.Therefore it decreases the running time when scanning the base.Compared with apriori algorithm,the new improved algorithm is more efficient. |
| |
| Keywords: | 2-itemsets pruning research |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
