CoChat

Graph Neural Networks for Ranking Web Pages

Scarselli, F., Sweah Liang Yong, Gori, M., Hagenbuchner, M., Ah Chung Tsoi, Maggini, M. · 2005 · The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)
Cited by 119

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

Abstract

An artificial neural network model, capable of processing general types of graph structured data, has recently been proposed. This paper applies the new model to the computation of customised page ranks problem in the World Wide Web. The class of customised page ranks that can be implemented in this way is very general and easy because the neural network model is learned by examples. Some preliminary experimental findings show that the model generalizes well over unseen Web pages, and hence, may be suitable for the task of page rank computation on a large Web graph.

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.1109/wi.2005.67

Cites

5 of 5 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

  • Topic-sensitive PageRank

    Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567

  • Scaling 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 · cited 2×

    “Graph Neural Networks for Ranking Web Pages Franco Scarselli Sweah Liang Yong Marco Gori University of Siena University of Wollongong University of Siena Siena, Italy Wollongong, Australia Siena, Italy franco@ing.unisi.it sly56@uow.edu.au marco@ing.unisi.it Markus Hagenbuchner Ah Chung Tsoi Marco Maggini University of…”
    Background
  • Generalization of back-propagation to recurrent neural networks

    Pineda, F. J. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.2229 · Cited by 931 · cited 1×

    “This algorithm, which was introduced in [9], is a combination of the backpropagation through structure algorithm, which is adopted for training recursive neural networks [19], and the Almeida–Pineda algorithm [1, 16].”
    Method
  • Supervised neural networks for the classification of structures

    Sperduti, A., & Starita, A. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572108 · Cited by 666 · cited 2×

    “The latter is a particular version of the backpropagation through time algorithm which can be used to train recurrent networks with cycles [19].”
    Method
  • Inside PageRank

    Bianchini, M., Gori, M., & Scarselli, F. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052938 · Cited by 539 · cited 1×

    “The approach is quite efficient in practice, because even if the web is represented by a very large graph, the exponential convergence ensures that the solution can be computed in few tens of iterations [2, 3].”
    BackgroundSelf-citation

Cited by

See all 119

Metadata

Authors
Scarselli, F., Yong, S. L., Gori, M., Hagenbuchner, M., Tsoi, A. C., & Maggini, M.
Venue
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)
Publisher
IEEE
Published
2005-10-18
Pages
666-672
OpenAlex
W2137175628
Cited by
119
References
5
FWCI
2.83
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.