首页 | 官方网站   微博 | 高级检索  
     

关联规则挖掘算法研究及改进
引用本文:孙广维.关联规则挖掘算法研究及改进[J].吉林建筑工程学院学报,2011,28(6):72-74.
作者姓名:孙广维
作者单位:吉林建筑工程学院计算机科学与工程学院,长春,130118
摘    要:关联规则挖掘是数据挖掘及知识发现领域的重要研究内容之一,其核心任务是挖掘数据库中的频繁项集.Apriori算法是频繁项集挖掘的有效算法.在Apriori的算法中,采用哈希树存储平凡项集的候补项集以便快速计算其支持度.本文在分析算法所存在的效率瓶颈的基础上,提出了一个有效的改进算法,通过利用一维数组替代算法中复杂的哈希树...

关 键 词:频繁项集  关联规则  算法  数据挖掘

The Research and Improvement on the Algorithm of Mining Association Rules
SUN Guang-wei.The Research and Improvement on the Algorithm of Mining Association Rules[J].Journal of Jilin Architectural and Civil Engineering,2011,28(6):72-74.
Authors:SUN Guang-wei
Affiliation:SUN Guang-wei (School of Computer Science and Engineering,Jilin Institute of Architecture and Civil Engineering,Changchun,China 130118)
Abstract:Miring of association rules is consider being one of the most important data mining tasks.Frequent itemsets mining plays an essential role in mining association rules.A lot of previous studies adopt an Apriori-like approach,in which Hash-tree is used to store candidate itemsets based on analyzing the bottleneck of performance for Apriori algorithm,an efficient algorithm for faster mining of frequent itemsets is proposed in this paper.It adopts one-dimension array instead of the complex hash-tree structure to expedite the mining process.The several experiments assess the relative performance of the algorithm in comparison with the Apriori and its extended algorithm.
Keywords:frequent itemsets  association rule  algorithm  data mining
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号