A quick rank based on web structure

Authors:
Hongbo Liu;Jiaxin Wang;Zehong Yang;Yixu Song
Affiliations:
State Key Lab of Intelligent Technology and System, Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;State Key Lab of Intelligent Technology and System, Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;State Key Lab of Intelligent Technology and System, Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;State Key Lab of Intelligent Technology and System, Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China
Venue:
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Year:
2006

Citing 3
Cited 0

On Krylov Subspace Approximations to the Matrix Exponential Operator

SIAM Journal on Numerical Analysis
Topic-sensitive PageRank

Proceedings of the 11th international conference on World Wide Web
Extrapolation methods for accelerating PageRank computations

WWW '03 Proceedings of the 12th international conference on World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hyperlink structure of the Web provides valuable information for ranking query results and has been used in some famous search engines. The development of search engines such as personalized and topic-sensitive search intensifies the need of quick rank algorithms. In this paper, a link based rank called ExpRank is proposed. It can converge quickly and reserve the fundamental features of PageRank. Experimental results comparing with PageRank on real dataset are also discussed.