| 基于向量和矩阵的挖掘关联规则的高效算法 |
| |
| 引用本文： | 牛小飞,石冰.基于向量和矩阵的挖掘关联规则的高效算法[J].计算机工程与应用,2004,40(12):170-173. |
| |
| 作者姓名： | 牛小飞 石冰 |
| |
| 作者单位： | 山东大学计算机科学与技术学院,济南,250061 |
| |
| 摘 要： | 挖掘关联规则是数据挖掘中一个重要的课题,产生频繁项目集是其中的一个关键步骤。文章提出了一种基于向量和矩阵的挖掘算法AVM,并将该算法与两种经典的发现频繁项目集的算法进行了比较。该算法只需要对数据库扫描一遍,并且存放辅助信息所需要的空间也少。实验表明与原先的算法相比,该算法的效率较好。
|
| 关 键 词： | 数据挖掘 关联规则频繁项集 基于向量和矩阵的算法 |
| 文章编号： | 1002-8331-(2004)12-0170-04 |
A High Efficiency Algorithm Based on Vectors and Matrix for Mining Associataion Rules |
| |
| Niu Xiaofei Shi,Bing.A High Efficiency Algorithm Based on Vectors and Matrix for Mining Associataion Rules[J].Computer Engineering and Applications,2004,40(12):170-173. |
| |
| Authors: | Niu Xiaofei Shi Bing |
| |
| Abstract: | Mining association rules is an important problem in data mining.Generating large itemsets is its key.This pa-per presents a novel algorithm based on vectors and matrix for finding frequent itemsets,and compares it with two tra-ditional algorithms.AVM only needs scan the database one time ,and occupies few memory for assistant information.Ex-periment results indicate that the new algorithm has good efficiency compared with presented ones. |
| |
| Keywords: | Data mining Association rules Large itemsets An algorithm based on vectors and matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
