Level-Based Link Analysis

In order to get high-quality web pages, search engines often resort retrieval pages by their ranks. The rank is a kind of measurement of importance of pages. Famous ranking algorithms, including PageRank and HITS, make use of hyperlinks to compute the importance. Those algorithms consider all hyperlinks identically in sense of recommendation. However, we find that the World Wide Web is actually organized with the natural multi-level structure. Benefiting from the level properties of pages, we can describe the recommendation of hyperlinks more reasonably and precisely. With this motivation, a new level-based link analysis algorithm is proposed in this paper. In the proposed algorithm, the recommendation weight of each hyperlink is computed with the level properties of its two endings. Experiments on the topic distillation task of TREC2003 web track show that our algorithm can evidently improve searching results as compared to previous link analysis methods.

• Type: Conference
• Year: 2005
• Where: APWEB
• Authors: Guang Feng, Tie-Yan Liu, Xu-Dong Zhang, Tao Qin, Bin Gao, Wei-Ying Ma
• Keywords: APWEB 2005, Hyperlink, Level Properties, Link Analysis Algorithm