| 关联规则挖掘中Apriori算法的研究与改进 |
| |
| 引用本文： | 马廷斌,徐芬. 关联规则挖掘中Apriori算法的研究与改进[J]. 兰州工业高等专科学校学报, 2010, 17(1): 13-15 |
| |
| 作者姓名： | 马廷斌 徐芬 |
| |
| 作者单位： | 西北师范大学,数学与信息科学学院,甘肃,兰州,730070 |
| |
| 摘 要： | 对Apriori算法加以改进，提出了一种更高效的关联规则挖掘算法，在扫描数据库的同时把支持每个项目的事务都标记出来，采用一种新的方法来计算候选项目集的支持度．该算法只需对源数据库进行一次扫描，就可以找出所有的频繁集，具有很高的效率．
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 频繁项集 |
Research and Improvement for Apriori Algorithm of Association Rule Mining |
| |
| MA Tin-bin,XU Fen. Research and Improvement for Apriori Algorithm of Association Rule Mining[J]. Journal of Lanzhou Higher Polytechnical College, 2010, 17(1): 13-15 |
| |
| Authors: | MA Tin-bin XU Fen |
| |
| Affiliation: | College of Mathematics and Information Science/a>;Northwest Normal University/a>;Lanzhou 730070/a>;China |
| |
| Abstract: | Based on Apriori algorithm,a more efficient algorithm for association rules mining are presented.The new algorithm adopts a unique way to calculate the supporting degree of every candidate item set by marking the transactions related to each item when scanning the database.This is a high efficient algorithm which can mine all the frequent item sets by scanning the source database only once. |
| |
| Keywords: | data mining association rule Apriori algorithm frequent item sets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
