G. Jen and J. Widom. Scaling personalized Web search. In Proceedings of the 12th International World Wide Wed Conference(WWW2003. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Link Analysis Ranking Algorithms Theory And Experiments - Borodin, Roberts.. (2004) (Correct)
....Jordan [40] and Achlioptas et al. 3] Tomlin [51] proposes a generalization of the PAGERANK algorithm that computes flow values for the edges of the Web graph, and a TrafficRank value for each page. There exists also a large body of work that deals with personalization of the PAGERANK algorithm [41, 23, 28, 43]. A different line of research exploits the application of probabilistic and statistical techniques for computing rankings. The PHITS algorithm by Cohn and Chang [13] assumes a probabilistic model in which a link is caused by latent factors or topics . They use the Expectation Maximization ....
G. Jen and J. Widom. Scaling personalized Web search. In Proceedings of the 12th International World Wide Wed Conference(WWW2003.
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