Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 187

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Scaling link-based similarity search

Fogaras, Dániel, Rácz, Balázs · 2005 · Proceedings of the 14th international conference on World Wide Web - WWW '05

Abstract

To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed architecture. The similarity of multi-step neighborhoods of vertices are numerically evaluated by similarity functions including SimRank [20], a recursive refinement of cocitation; PSimRank, a novel variant with better theoretical characteristics; and the Jaccard coefficient, extended to multi-step neighborhoods. Our methods are presented in a general framework of Monte Carlo similarity search algorithms that precompute an index database of random fingerprints, and at query time, similarities are estimated from the fingerprints. The performance and quality of the methods were tested on the Stanford Webbase [19] graph of 80M pages by comparing our scores to similarities extracted from the ODP directory [26]. Our experimental results suggest that the hyperlink structure of vertices within four to five steps provide more adequate information for similarity search than single-step neighborhoods.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1060745.1060839

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

  • Graph structure in the Web

    Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 1×

    “Notice that scalability here is non-trivial, since the the Jaccard coefficient may involve extremely large sets: the multi-step neighborhood of a vertex usually contains a large portion of the pages [4].”
    Background
  • Towards Scaling Fully Personalized PageRank

    Fogaras, D., & Rácz, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30216-2_9 · Cited by 84

    Self-citation
  • I/O-efficient techniques for computing pagerank

    Chen, Y.-Y., Gan, Q., & Suel, T. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584882 · Cited by 59 · cited 3×

    “The main contribution of this section is that we give semi-external memory, external memory and distributed algorithms similar to PageRank iterations [27, 9] that compute the minhash fingerprints for the multi-step neighborhoods of vertices.”
    BackgroundMethodInfluential

Show all 3 references

Cited by

See all 187

Metadata

Authors
Fogaras, D., & Rácz, B.
Venue
Proceedings of the 14th international conference on World Wide Web - WWW '05
Publisher
ACM Press
Published
2005
Pages
641
OpenAlex
W1995973731
Cited by
187
References
3
Type
conference abstract
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Scaling link-based similarity search. https://app.cochat.ai/papers/10.1145/1060745.1060839
The paper
Fogaras, D., & Rácz, B. (2005). Scaling link-based similarity search. Proceedings of the 14th international conference on World Wide Web - WWW '05. https://doi.org/10.1145/1060745.1060839

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.