web链接结构掘中hits算支的分析与改进.pdf

摘 要 近年来,随着Internet/Web 技术的快速普及和迅猛发展,它为人们提供了丰富 的信息资源的同时,其所具有的海量数据、复杂性、极强的动态性和用户的多态性 等特点也给Web 资源的发掘造成了相当的难度。因此,将数据挖掘技术和Web 结 合起来,进行Web 数据挖掘也就随之成为解决Web 挖掘问题的重要途径。 在传统的信息检索技术己经成熟的现状下,从 Web 数据本身的特点出发,充 分地挖掘Web 上庞大的超链接资源,通过超链接进行搜索,建立有效的Web 信息 检索模型,从而找到我们需要的信息。但传统的基于超链接的网页搜索排序算法是 纯粹地基于链接分析(即Web 结构挖掘)来发现权威网页,没有考虑网页的具体内 容,存在所谓的“主题漂移”问题,即算法的结果往往包含这样一些网页,它们相互 链接密度较高,但在内容上却偏离了查询主题。 本文通过对经典的Web 结构挖掘算法HITS 算法的研究学习,针对HITS 算法 中只考虑Web 页面之间的超链接分析而忽略了Web 页面的内容,从而导致分析结 果出现“主题偏移”和主题之间的多重加强关系等不足,提出了一种结合超链接分 析和内容相关性分析的关于HITS 算法的改进算法——G-HITS 算法,该算法通过 对不同Web 页面进行内容分析并赋予链接之间不同的权重来实现对HITS 算法的 改进,一定程度上改善了 HITS 算法的不足,更好的实现了权威网页的查找。最后 通过实验证明G-HITS 算法的有效性。 关键字：Web ；结构挖掘；超链接；HITS ；G-HITS II Abstract Recently, along with the quick popularization and development of the Internet and Web technology, it supplies people with abundant information. Internet constructed based on huge volume of data and its complexity, extreme dynamic and all kinds of clients have made the internet source development difficult.Therefore,locating valuable information in the Web has become the important issue in the area of Web Data mining.The traditional method of information browser has been mature and under the circumstance, we mine huge linkage resource on the Web according to the attribute of it.Then we search and build the Web indormation retrieval model to find information we need. The current method of locating the ring web page is based on the hyperlink ranking algorithm.However,such method may cause the topic drift problem,which is the results of algorithm is often irrelevant with the searching topic,but has high link density. By studying the classical Web structure mining algorithm HITS and considering that the HITS only calculates the hyperlink among