使用频繁结构提炼网络权威资源

在网络资源中有丰富的、对于许多应用领域有用的动态信息，已有许多的研究工作致力于提高网络中信息检索的质量，然而，这些工作中的大部分仍不能满足用户形形色色的请求．利用网络中的超链接提出新的算法ESFP来改善从搜索引擎返回的搜索结果的质量．运用SFP算法构造ESFP算法，完成从复杂的网络拓扑结构中提取权威的页面和社团．通过运行若干个实验来描述所提出的算法，这些实验数据表明，在处理搜索结果中使用ESFP算法在性能上要优于许多已知的算法如HITS等．

Refining Web Authoritative Resource by Frequent Structures

The web resource is a rich collection of the dynamic information that is useful in various disciplines There has also been much research work related to improving the quality of information searching in the web However, most of the work is still inadequate to satisfy a diversified demand from users In this paper, the hyperlinks in the web are exploited and a new approach called ESFP is proposed in order to improve the quality of research results obtain from search engines The essential idea of approach is to mine the frequent structures of links from a given web topology By using the SFP algorithm, the authoritative pages and communities are extracted from the complex web topology The approach proposed is demonstrated by running several experiments and it is shown that the functionalities of using the ESFP in managing search results are better than other known methods such as HITS