We analyze linkage strategies for a set I of webpages for which the webmaster wants to maximize the sum of Google's PageRank scores. The webmaster can only choose the hyperlinks starting from the webpages of I and has no control on the hyperlinks from other webpages. We provide an optimal linkage strategy under some reasonable assumptions.
The paper introduces a novel algorithm derived from the PageRank algorithm of Brin and Page. The PageRank algorithm interprets an hyperlink from page a to page b as being a positive vote from a to b. Starting from this interpretation , it attributes a rank to each page. However, it does not offer the possibility to take into account negative votes. The… (More)
The paper introduces a novel iterative method that assigns a reputation to n + m items: n raters and m objects. Each rater evaluates a subset of objects leading to a n × m rating matrix with a certain sparsity pattern. From this rating matrix we give a nonlinear formula to define the reputation of raters and objects. We also provide an iterative algorithm… (More)