In this paper, we will provide an overview of some of the more recent developments in web graph processing using the classic Google page rank equation as popularized by Brins and Page [1], and its modifications, to handle page rank and personalized page rank determinations. It is shown that one may progressively modify the linear matrix stochastic equation underlying the Google page rank determinations [1] to one which may contain neural network formulations. Furthermore the capability of these modifications in determining personalized page ranks is demonstrated through a number of examples based on the web repository WT10G. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Tsoi, A. C., Scarselli, F., Gori, M., Hagenbuchner, M., & Yong, S. L. (2005). A neural network approach to Web graph processing. In Lecture Notes in Computer Science (Vol. 3399, pp. 27–38). Springer Verlag. https://doi.org/10.1007/978-3-540-31849-1_4
Mendeley helps you to discover research relevant for your work.