| 一种改进的基于矩阵的频繁项集挖掘算法 |
| |
| 引用本文： | 张笑达,徐立臻.一种改进的基于矩阵的频繁项集挖掘算法[J].微机发展,2010(4):93-96. |
| |
| 作者姓名： | 张笑达 徐立臻 |
| |
| 作者单位： | 东南大学计算机系; |
| |
| 摘 要： | 如何从海量数据信息中挖掘出有用的关联规则已经成为人们广泛关注的问题，而在关联规则挖掘中，首要的问题就是如何高效地挖掘出频繁项集。针对已有FIMM算法作出改进，提出了一种改进的基于矩阵的频繁项集挖掘算法N—FIMM，该算法在FIMM基础上去除大量冗余的非频繁项集的项集，减少计算可能频繁项集的工作量，同时缩小了矩阵规模，提高了空间效率。通过对矩阵操作，一次性地产生所有的频繁项集。试验结果表明，该算法对已有的基于矩阵的频繁项集挖掘算法有了很大的改进，提高了挖掘效率。
|
| 关 键 词： | 数据挖掘 频繁项集 FIMM |
An Advanced Frequent Itemsets Mining Algorithm Based on Matrix |
| |
| ZHANG Xiao-da,XU Li-zhen.An Advanced Frequent Itemsets Mining Algorithm Based on Matrix[J].Microcomputer Development,2010(4):93-96. |
| |
| Authors: | ZHANG Xiao-da XU Li-zhen |
| |
| Affiliation: | ZHANG Xiao-da,XU Li-zhen(Computer College,Southeast University,Nanjing 211189,China) |
| |
| Abstract: | How to mine the useful association rule from large numbers of data information has been a main problem concerned widely.While in the mining of association rule,the chief question is how to mine out the frequent itemsets effectively.An advanced frequent itemsets mining algorithm based on FIMM is proposed in this paper.Through deleting unnecessary itemsets,the algorithm greatly deminish the workload of getting itemsets as well as minify the scale of matrix.Thus,the efficiency of space utility is largely impro... |
| |
| Keywords: | data mining frequent itemset FIMM |
| 本文献已被 CNKI 维普 等数据库收录！ |
