Web数据兴趣区域数据挖掘过程分析  

Web Data Interest Area Data Mining Process Analysis

作　　者：莫学值[1] 韦必忠[1] 

机构地区：[1]广西工业职业技术学院,广西530001

出　　处：《科技通报》2013年第4期202-203,206,共3页Bulletin of Science and Technology

摘　　要：Web页面包含复杂的、无结构的、动态的数据信息,快速找到感兴趣的Web数据信息过程受到干扰。为了避免上述问题,提出了一种对改进的Apriori算法用于Web数据区域兴趣区的挖掘分析,对传统的算法进行改进,在自然连接产生候选集以前对Web数据进行一个修剪过程,减少参加连接的项集数量,因而减小生成的候选项集规模,减少了循环迭代次数和运行时间,同时在连接判断步骤中减少多余的判断次数,保证Web兴趣区域挖掘的高效性。实验证明,利用上面阐述的算法进行Web兴趣区域数据挖掘,能够有效提高挖掘的效率,效果较好。The Web page contains complex,no structure,dynamic data information,quickly find interested in Web data information process interference.In order to avoid the above problems,this paper puts forward a improved Apriori algorithm used in web data mining area of interest,based on the analysis of the traditional algorithm was improved,and in the natural connection to generate candidate set of web data before a pruning process,reduce the number of connections in a set,thus reduce the candidate itemsets generation scale,reduce the iterative times and operation time,at the same time in connection judgment step to reduce redundant judgment,to ensure that the number of web interest area mining efficiency.The experiment proves that the top of this algorithm in web data mining area,can effectively improve the efficiency of mining,the effect is good.

关 键 词：Web数据 兴趣区域 数据挖掘 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]