Approximation Quality of the RBS Ranking Algorithm

  • Sydow M
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The RBS algorithm is a novel link-based algorithm for ranking results of a search engine. RBS may be viewed as an extension of PageRank by a parameterized ``back button'' modeling. RBS is based on the ``random surfer with back step'' model [7] similarly as PageRank is based on the simpler ``random surfer'' model [4]. To scale to real Web RBS computes merely a fast probabilistic approximation of the ranking induced by the ``random surfer with back step'' model [6].

Cite

CITATION STYLE

APA

Sydow, M. (2006). Approximation Quality of the RBS Ranking Algorithm. In Intelligent Information Processing and Web Mining (pp. 289–296). Springer-Verlag. https://doi.org/10.1007/3-540-32392-9_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free