Effective site finding using link anchor information
The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Link-based ranking methods have been described in the literature and applied in commercial Web search engines. However, according to recent TREC experiments, they are no better than traditional content-based methods. We conduct a different type of experiment, in which the task is to find the main entry point of a specific Web site. In our experiments, ranking based on link anchor text is twice as effective as ranking based on document content, even though both methods used the same BM25 formula. We obtained these results using two sets of 100 queries on a 18.5 million document set and another set of 100 on a 0.4 million document set. This site finding effectiveness begins to explain why many search engines have adopted link methods. It also opens a rich new area for effectiveness improvement, where traditional methods fail.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Robertson, S. E., Walker, S., Jones, S., Hancock‐Beaulieu, M., & Gatford, M. (1994) · Text REtrieval Conference · Cited by 2,212
Self-citationImproved 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
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
Davison, B. D. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345597 · Cited by 264
GENVL and WWWW: Tools for taming the Web
McBryan, O. A. (1994) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(94)90149-x · Cited by 242
Does “authority” mean quality? predicting expert quality ratings of Web documents
Amento, B., Terveen, L., & Hill, W. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345603 · Cited by 225
Incorporating quality metrics in centralized/distributed information retrieval on the World Wide Web
Zhu, X., & Gauch, S. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345602 · Cited by 216
WebQuery: searching and visualizing the Web through connectivity
Carrière, S. J., & Kazman, R. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00062-7 · Cited by 173
Results and challenges in Web search evaluation
Hawking, D., Craswell, N., Thistlewaite, P. B., & Harman, D. K. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00024-9 · Cited by 158
Self-citation
Cited by
Broder, A. (2002) · ACM SIGIR Forum · doi:10.1145/792550.792552 · Cited by 1,944
Optimizing web search using social annotations
Bao, S., Xue, G., Wu, X., Yu, Y., Fei, B., & Su, Z. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242640 · Cited by 546
Can social bookmarking improve web search?
Heymann, P., Koutrika, G., & Garcia-Molina, H. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341558 · Cited by 434
Automatic identification of user goals in Web search
Lee, U., Liu, Z., & Cho, J. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060804 · Cited by 400
Challenges in web search engines
Henzinger, M. R., Motwani, R., & Silverstein, C. (2002) · ACM SIGIR Forum · doi:10.1145/792550.792553 · Cited by 307
Metadata
- Authors
- Craswell, N., Hawking, D., & Robertson, S.
- Venue
- Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2001-09
- Pages
- 250-257
- OpenAlex
- W2164052363
- Cited by
- 269
- References
- 11
- FWCI
- 21.45
- Type
- conference paper
- 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.