基于Apriori算法的频繁访问页面挖掘分析  

Analysis of Frequent Access Pages Mining Based on Apriori Algorithm

作　　者：王靓明[1] 杨文琳[2] 朱敏[1] 

机构地区：[1]南昌大学信息工程学院,江西南昌330031 [2]江西理工大学南昌校区,江西南昌330013

出　　处：《计算机与现代化》2009年第12期21-24,共4页Computer and Modernization

基　　金：江西省重点攻关项目(0511071)

摘　　要：挖掘最大频繁项目集是数据挖掘应用中关联规则的关健问题。本文结合SQL语言的特点,对Apriori算法进行改进,由于改进后的Apriori算法不需要多次扫描数据库,实现过程不断采用临时表,不断缩小搜索空间,从而提高Apriori算法运行效率。将其应用至频繁访问页面挖掘中,从而找出W eb访问信息的关联规则,更好地组织站点的W eb空间,为用户带来方便。Mining maximum frequent item sets is the key issues in the application of data mining association rules. Combined with features of SQL language, improvement on Apriori algorithm can make efficiency improvements to a certain extent, because im- proved Apriori algorithm does not need to scan the database many times and narrows the search space constantly. The paper puts the application into frequently visiting in the page mining to find out the association rules of Web visited information, to better organize the Web site space for the convenience of users.

关 键 词：SQL 频繁访问页面 关联规则 APRIORI算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]