The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
(1999) · Cited by 12,854
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
A comparison of event models for naive bayes text classification
McCallum, A., & Nigam, K. (1998) · Cited by 3,289
Rank aggregation methods for the Web
Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372165 · Cited by 1,793
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Self-citationScaling personalized web search
Jeh, G., & Widom, J. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775191 · Cited by 1,195
Placing search in context: the concept revisited
Finkelstein, L., Gabrilovich, E., Matias, Y., Rivlin, E., Solan, Z., Wolfman, G., & Ruppin, E. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372094 · Cited by 839
(2003) · doi:10.5555/644108.644113 · Cited by 762
Managing Gigabytes: Compressing and Indexing Documents and Images
Witten, I. H., Moffat, A., & Bell, T. C. (1995) · IEEE Transactions on Information Theory · doi:10.1109/tit.1995.476344 · Cited by 726
Automatic resource compilation by analyzing hyperlink structure and associated text
Chakrabarti, S., Dom, B., Raghavan, P., Rajagopalan, S., Gibson, D., & Kleinberg, J. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00087-7 · Cited by 697
Mining the Web: Discovering Knowledge from Hypertext Data
Chakrabarti, S. (2002) · Thammasat University Digital Collections · Cited by 696
Improved Algorithms for Topic Distillation in a Hyperlinked Environment
Bharat, K., & Henzinger, M. R. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130367 · Cited by 676
Fagin, R., Kumar, R., & Sivakumar, D. (2003) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480102412856 · Cited by 552
Winners don't take all: Characterizing the competition for links on the web
Pennock, D. M., Flake, G. W., Lawrence, S., Glover, E. J., & Giles, C. L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.032085699 · Cited by 455
Improved algorithms for topic distillation in a hyperlinked environment
Bharat, K., & Henzinger, M. R. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290972 · Cited by 444
Witten, I. H. (1994) · Cited by 428
Extrapolation methods for accelerating PageRank computations
Kamvar, S. D., Haveliwala, T. H., Manning, C. D., & Golub, G. H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775190 · Cited by 407
Self-citationThe Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
Richardson, M., & Domingos, P. (2001) · Cited by 356
(1999) · Cited by 293
WebBase: a repository of Web pages
Hirai, J., Raghavan, S., Garcia-Molina, H., & Paepcke, A. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00063-3 · Cited by 183
What can you do with a Web in your Pocket
Brin, S., Motwani, R., Page, L. M., & Winograd, T. A. (1998) · Cited by 140
Authoritative Sources in a Hyperlinked Environment
Kleinberg, J. M. (2011) · Princeton University Press eBooks · doi:10.1515/9781400841356.514 · Cited by 138
What is this page known for? Computing Web page reputations
Rafiei, D., & Mendelzon, A. O. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00078-5 · Cited by 126
The structure of broad topics on the web
Chakrabarti, S., Joshi, M. M., Punera, K., & Pennock, D. M. (2002) · International World Wide Web Conference (WWW) · doi:10.1145/511446.511480 · Cited by 118
Web page scoring systems for horizontal and vertical search
Diligenti, M., Gori, M., & Maggini, M. (2002) · International World Wide Web Conference (WWW) · doi:10.1145/511446.511512 · Cited by 55
Bharat, K. A., & Mihaila, G. A. (2001) · International World Wide Web Conference (WWW) · doi:10.1145/371920.372162 · Cited by 44
Efficient Encodings for Document Ranking Vectors
Haveliwala, T. H. (2002) · Cited by 13
Self-citation
Cited by
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582
The link‐prediction problem for social networks
Liben‐Nowell, D., & Kleinberg, J. (2007) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20591 · Cited by 3,043
Coifman, R. R., & Lafon, S. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.04.006 · Cited by 2,342
The link prediction problem for social networks
Liben-Nowell, D., & Kleinberg, J. (2003) · Proceedings of the twelfth international conference on Information and knowledge management · doi:10.1145/956863.956972 · Cited by 1,612
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
Metadata
- Authors
- Haveliwala, T. H.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2003-07
- Volume
- 15
- Issue
- 4
- Pages
- 784-796
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2124168655
- Cited by
- 1,052
- References
- 30
- FWCI
- 43.19
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.