| 矩阵与前缀树方法挖掘频繁项集 |
| |
| 引用本文： | 丁邦旭,黄永青. 矩阵与前缀树方法挖掘频繁项集[J]. 计算机工程与应用, 2015, 51(22): 154-157 |
| |
| 作者姓名： | 丁邦旭 黄永青 |
| |
| 作者单位： | 铜陵学院 数学与计算机学院，安徽 铜陵 244000 |
| |
| 摘 要： | 传统频繁项集挖掘算法的执行效率较低。提出了一种基于矩阵与前缀树的频繁项集挖掘算法MPFI，能快速地挖掘事务数据库中的频繁项集。MPFI算法只需扫描事务数据库一次，构建垂直方向的二进制矩阵，应用二进制位向量表达频繁项集信息，利用前缀树压缩存储频繁项集的相关信息，不产生候选项集。理论分析与实验结果表明，MPFI算法能有效地提高频繁项集挖掘效率。
|
| 关 键 词： | 频繁项集 矩阵 二进制 前缀树 |
Algorithm of matrix and Prefix-tree for mining frequent itemsets |
| |
| DING Bangxu,HUANG Yongqing. Algorithm of matrix and Prefix-tree for mining frequent itemsets[J]. Computer Engineering and Applications, 2015, 51(22): 154-157 |
| |
| Authors: | DING Bangxu HUANG Yongqing |
| |
| Affiliation: | School of Mathematics and Computer, Tongling University, Tongling, Anhui 244000, China |
| |
| Abstract: | Traditional algorithm of frequent itemsets mining’s execution efficiency is low. MPFI algorithm based on matrix and Prefix-tree is raised for frequent itemsets mining. It can quickly mining frequent itemsets of transaction database. MPFI algorithm only scan transaction database once, builds vertical binary matrix. Binary vector for frequent itemsets information and Prefix-tree data structure for compression storage of frequent itemsets is applied in the algorithm, without candidate itemsets. According to theoretical analysis and experimental results, MPFI algorithm can effectively improve the efficiency of frequent itemsets mining. |
| |
| Keywords: | frequent itemsets matrix binary Prefix-tree |
|
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
