Graph Neural Networks for Ranking Web Pages
2005pp. 666–672
Citations Over TimeTop 10% of 2005 papers
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.
Related Papers
- → Scholars and the use of the internet(1997)37 cited
- → Cumulated Relative Position: A Metric for Ranking Evaluation(2012)10 cited
- A Mathematical Structure of Processes for Generating Rankings Through the Use of Nonnegative Irreducible Matrices(2010)
- A CONTROLLED ABSOLUTE RANKING METHOD APPLIED TO AN EXAM OF MULTIPLEX CHOICE FORM(2008)