| A. Mendelzon, D. Rafiei, What do the neighbours think? Computing web page reputations, IEEE Data Engineering Bulletin 23 (3) (2000) 9 -- 16. |
....of Kleinberg [31, 32] and Brin and Page [9] was followed by a number of extensions and modifications. Bharat and Henzinger [5] and Chakrabarti et al. 11] consider improvements on the HITS algorithm by using textual information to weight the importance of nodes and links. Rafiei and Mendelzon [42, 38] consider a variation of the HITS algorithm that uses random jumps, similar to SALSA. The same algorithm is also considered by Ng Zheng and Jordan [39, 40] termed Randomized HITS. Extensions of the HITS algorithm that use multiple eigenvectors were proposed by Ng, Zheng and Jordan [40] and ....
A. Mendelzon and D. Rafiei. What do the neighbours think? Computing Web page reputations. IEEE Data Engineering Bulletin, 23(3):9--16, 2000.
....sources is a challenge to metasearch engines. We present an autonomous ranking method, meaning one that does not depend on the individual rankings returned by the engines participating in the search. Instead, it applies our TOPIC method for evaluating the reputation of a web page on a topic [7, 6] to the problem of ranking the results to a query. TOPIC is available at www.cs.toronto.edu db topic) Methods for ranking query result pages based on some notion of relatedness or authoritativeness have been studied in the literature [5, 1] and implemented in commercial systems [3] There is ....
A.O. Mendelzon and D. Rafiei. What do the neighbours think? Computing Web page reputations. IEEE Data Engineering Bulletin, 23(3):9--16, 2000.
No context found.
A. Mendelzon, D. Rafiei, What do the neighbours think? Computing web page reputations, IEEE Data Engineering Bulletin 23 (3) (2000) 9 -- 16.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC