The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Proceedings of the 11th international conference on World Wide Web
Scaling personalized web search
WWW '03 Proceedings of the 12th international conference on World Wide Web
Ranking tournaments: Local search and a new algorithm
Journal of Experimental Algorithmics (JEA)
Measuring social tag confidence: is it a good or bad tag?
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Power walk: revisiting the random surfer
Proceedings of the 18th Australasian Document Computing Symposium
Social-oriented visual image search
Computer Vision and Image Understanding
Hi-index | 0.00 |
The PageRank algorithm is used in Web information retrieval to calculate a single list of popularity scores for each page in the Web. These popularity scores are used to rank query results when presented to the user. By using the structure of the entire Web to calculate one score per document, we are calculating a general popularity score, not particular to any community. Therefore, the PageRank scores are more suited to general queries. In this paper, we introduce a more general form of PageRank, using Web multi-resolution community-based popularity scores, where each document obtains a popularity score dependent on a given Web community. When a query is related to a specific community, we choose the associated set of popularity scores and order the query results accordingly. Using Web-community based popularity scores, we achieved an 11% increase in precision over PageRank.