In this article, we present a new approach to page ranking. The page rank of a collection of Web pages can be represented in a parameterized model, and the user requirements can be represented by a set of constraints. For a particular parameterization, namely, a linear combination of the page ranks produced by different forcing functions, and user requirements represented by a set of linear constraints, the problem can be solved using a quadratic programming method. The solution to this problem produces a set of parameters which can be used for ranking all pages in the Web. We show that the method is suitable for building customized versions of PageRank which can be readily adapted to the needs of a vertical search engine or that of a single user.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
|Titolo:||Computing customized page ranks|
|Citazione:||Tsoi, A.C., Hagenbuchner, M., & Scarselli, F. (2006). Computing customized page ranks. ACM TRANSACTIONS ON INTERNET TECHNOLOGY, 6(4), 381-414.|
|Appare nelle tipologie:||1.1 Articolo in rivista|