CoChat
Sign Up
Cited by 84Information Retrieval and Search BehaviorWeb Data Mining and AnalysisAlgorithms and Data Compression

Towards Scaling Fully Personalized PageRank

Fogaras, Dániel, Rácz, Balázs·2004·Lecture Notes in Computer Science
DOI 10.1007/978-3-540-30216-2_9
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-540-30216-2_9

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The end-point of a random walk that starts from a random page and can be terminated at each step with probability 1-c is a sample from the distribution π.

    “The end-point of a random walk that starts from a random page and can be terminated at each step with probability 1 -c , appears to be a sample from the distribution π [4, 7, 9].”

    From Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient (2007) · cites this paper as [7]

  • Only two works have applied Monte Carlo methods to the PageRank computation.

    “To our best knowledge only in two works [3, 7] the Monte Carlo methods are applied to the PageRank computation.”

    From Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient (2007) · cites this paper as [7]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Fogaras, D., & Rácz, B.
Affiliations
Budapest University of Technology and Economics (HU)
Corresponding author
Fogaras, Dániel
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2004
Pages
105-117
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-540-30216-2_9
OpenAlex
W1550457191
Cited by
84
References
1
Citations by year
2025: 1 · 2023: 1 · 2021: 2 · 2020: 3 · 2019: 2 · 2018: 1 · 2017: 6 · 2016: 5 · 2015: 3 · 2014: 4 · 2013: 8 · 2012: 4
FWCI
4.42
Type
conference paper
Language
en
Open access
closed
Licence
www.springer.com/tdm (unspecified)
Locations
  • Lecture notes in computer science (publishedVersion)
  • SZTAKI Publication Repository (Hungarian Academy of Sciences) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Physical Sciences › Computer Science › Information Systems › Web Data Mining and Analysis
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
Keywords
personalized PageRank, random walks, web page quality, backlinks, query processing, lower bounds

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