.png){kind=icon}
Return
Topic-sensitive PageRank: A context-sensitive ranking algorithm for Web search
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2003.1208999.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative importance of Web pages, independent of any particular search query. To yield more accurate search results, we propose computing a set of PageRank vectors, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic. For ordinary keyword search queries, we compute the topic-sensitive PageRank scores for pages satisfying the query using the topic of the query keywords. For searches done in context (e.g., when the search query is performed by highlighting words in a Web page), we compute the topic-sensitive PageRank scores using the topic of the context in which the query appeared. By using linear combinations of these (precomputed) biased PageRank vectors to generate context-specific importance scores for pages at query time, we show that we can generate more accurate rankings than with a single, generic PageRank vector. We describe techniques for efficiently implementing a large-scale search system based on the topic-sensitive PageRank scheme.
Keywords:
Web search
web graph
link analysis
PageRank
search in context
personalized search
ranking algorithm
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveFast inversion of formation permeability from Stoneley wave logs using a simplified Biot‐Rosenbaum model.png)
GEOPHYSICS
GEOPHYSICSIF0
PREAI
ShareSave
View more