| 基于关联矩阵的频繁项集挖掘算法 |
| |
| 引用本文： | 张雅芬,王新.基于关联矩阵的频繁项集挖掘算法[J].云南民族大学学报(自然科学版),2012,21(2):138-140,144. |
| |
| 作者姓名： | 张雅芬 王新 |
| |
| 作者单位： | 云南民族大学数学与计算机科学学院,云南昆明,650500 |
| |
| 基金项目： | 云南省教育厅科学研究基金(2011Z025) |
| |
| 摘 要： | 根据经典Apriori性质和算法思想,提出了一种基于关联矩阵的挖掘频繁项集的算法.应用实例分析表明,该算法在挖掘过程中,只需扫描一次数据库,有效地减少了扫描数据库的次数,提高了算法的效率.
|
| 关 键 词： | Apriori算法 关联矩阵 频繁项集 |
An Algorithm for Mining Frequent Itemsets Based on Associated Matrix |
| |
| ZHANG Ya-fen
,
WANG Xin.An Algorithm for Mining Frequent Itemsets Based on Associated Matrix[J].Journal of Yunnan Nationalities University:Natural Sciences Edition,2012,21(2):138-140,144. |
| |
| Authors: | ZHANG Ya-fen WANG Xin |
| |
| Institution: | (School of Mathematics and Computer Science,Yunnan University of Nationalities,Kunming 650500,China) |
| |
| Abstract: | According to the ideas and properties of the classical Apriori algorithm,a new algorithm for mining frequent itemsets is proposed,which is based on the associated matrix.Through the analysis of the example,it has been found that this algorithm scans the database only for one time and reduces the number of scanning during the mining process,and improves the efficiency of the algorithm. |
| |
| Keywords: | Apriori algorithm associated matrix frequent itemsets |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
