摘要
挖掘最大频繁项目集是数据挖掘应用中关联规则的关健问题。本文结合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.
出处
《计算机与现代化》
2009年第12期21-24,共4页
Computer and Modernization
基金
江西省重点攻关项目(0511071)
