| 改进的频繁项集挖掘算法研究 |
| |
| 引用本文： | 王艳,李玲玲,邵晓艳.改进的频繁项集挖掘算法研究[J].计算机工程与应用,2012,48(19):119-121,144. |
| |
| 作者姓名： | 王艳 李玲玲 邵晓艳 |
| |
| 作者单位： | 郑州航空工业管理学院计算机科学与应用系,郑州,450015 |
| |
| 基金项目： | 国家自然科学基金，教育部新世纪优秀人才支持计划，河南省科技创新杰出青年基金，河南省重点科技攻关计划项目，航空科学基金 |
| |
| 摘 要： | 通过对关联规则挖掘技术及经典算法Apriori和FP-growth的研究和分析,提出了一种改进的频繁项集挖掘算法。该算法利用矩阵存储数据,并结合矩阵运算求项集的支持数,有效减少了事务数据库的扫描次数;利用有序频繁项目邻接矩阵创建频繁模式树,有效减少了频繁模式树的分支和层数。通过实例分析了频繁项集的挖掘过程。
|
| 关 键 词： | 数据挖掘 关联规则 邻接矩阵 频繁模式树 |
Research on advanced frequent itemsets mining algorithm |
| |
| WANG Yan
,
LI Lingling
,
SHAO Xiaoyan.Research on advanced frequent itemsets mining algorithm[J].Computer Engineering and Applications,2012,48(19):119-121,144. |
| |
| Authors: | WANG Yan LI Lingling SHAO Xiaoyan |
| |
| Affiliation: | Department of Computer Science and Application,Zhengzhou Institute of Aeronautic Industry Management,Zheng-zhou 450015,China |
| |
| Abstract: | In view of the association rule mining technology and the research and analysis of its classic Apriori algorithm and FP-growth algorithm,an advanced frequent itemsets mining algorithm is proposed.The improved algorithm stores database using of matrix and calculates itemsets’support number in terms of the matrix operation,which reduces the number of times for database scanning.The algorithm creates frequent pattern tree using of orderly frequent item adjacency matrix,which effectively reduces the branch and layer of the tree.Finally the examples analyze the frequent itemsets of mining process. |
| |
| Keywords: | data mining association rules adjacency matrix frequent pattern tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
