Davood Rafiei and Alberto Mendelzon. What is this page known for? Computing web page reputations. In Proc. 9th World Wide Web Conference, Amsterdam, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Downweighting Tightly Knit Communities in World Wide Web.. - Roberts, Rosenthal (2003) (5 citations) (Correct)
....fully Bayesian approach, but nd that it is too sensitive to prior information to be useful at this point. Keywords: tightly knit communities, link analysis, web searching, hubs, authorities, SALSA, Kleinberg s algorithm, clusters, Bayesian. 1 Introduction In recent years, a number of papers [2, 5, 7, 6, 3, 1] have considered the use of hypertext links to determine the authority value of di erent web pages. In particular, these papers consider the extent to which hypertext links between World Wide Web documents can be used to determine the relative authority values of these documents for various web ....
D. Ra ei and A. Mendelzon. What is this page known for? Computing web page reputations. In 9th International World Wide Web Conference, Amsterdam, Netherlands, 2000. 12
Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm .. - Haveliwala (2003) (3 citations) (Correct)
....queries. Hilltop generates a query specific authority score by detecting and indexing pages that appear to be good experts for certain keywords, based on their outlinks. However, query terms for which experts were not found will not be handled by the Hilltop algorithm. Rafiei and Mendelzon [28] propose using the set of Web pages that contain some term as a bias set for influencing the PageRank computation, with the goal of returning terms for which a given page has a high reputation. An approach for enhancing search rankings by generating a PageRank vector for each possible query term ....
Davood Rafiei and Alberto O. Mendelzon. What is this page known for? Computing web page reputations. In Proceedings of the Ninth International World Wide Web Conference, 2000.
Web Information Retrieval - an Algorithmic Perspective - Henzinger (2000) (Correct)
....from all nodes q such that edge (p i ; q) exists in the graph. The PageRank measure works very well in distinguishing high quality Web pages from low quality Web pages and is used in the Google search engine . 5 Recent work re ned the PageRank criterion and sped up its computation, see e.g. [33, 19]. In [20, 21] PageRank like random walks were performed to sample Web page almost according to the PageRank distribution and the uniformly distribution, respectively. The goal was to compute various statistics on the Web pages and to compare the quality, respectively the number, of the pages in ....
D. Ra ei, and A. Mendelzon. What is this page known for? Computing Web page reputations. In Proceedings of the Ninth International World Wide Web Conference 2000, pages 823-836.
Topic-Sensitive PageRank - Haveliwala (2002) (67 citations) (Correct)
....improve results for popular queries. Hilltop generates a query specific authority score by detecting and indexing pages that appear to be good experts for certain keywords, based on their outlinks. However, query terms for which experts were not found will not be handled by the Hilltop algorithm. [17] proposes using the set of Web pages that contain some term as a bias set for influencing the PageRank computation, with the goal of returning terms for which a given page has a high reputation. An approach for enhancing search rankings by generating a PageRank vector for each possible query term ....
Davood Rafiei and Alberto O. Mendelzon. What is this page known for? Computing web page reputations. In Proceedings of the Ninth International World Wide Web Conference, 2000.
Topic-Sensitive PageRank - Haveliwala (2002) (67 citations) (Correct)
....improve results for popular queries. Hilltop generates a query speci c authority score by detecting and indexing pages that appear to be good experts for certain keywords, based on their outlinks. However, query terms for which experts were not found will not be handled by the Hilltop algorithm. [17] proposes using the set of Web pages that contain some term as a bias set for in uencing the PageRank computation, with the goal of returning terms for which a given page has a high reputation. An approach for enhancing search rankings by generating a PageRank vector for each possible query term ....
Davood Ra ei and Alberto O. Mendelzon. What is this page known for? Computing web page reputations. In Proceedings of the Ninth International World Wide Web Conference, 2000.
Ranking the Web Frontier - Eiron, McCurley, Tomlin (2004) (19 citations) (Correct)
No context found.
Davood Rafiei and Alberto Mendelzon. What is this page known for? Computing web page reputations. In Proc. 9th World Wide Web Conference, Amsterdam, 2000.
A Survey of Eigenvector Methods of Web Information Retrieval - Langville, Meyer (2003) (2 citations) (Correct)
No context found.
Davood Rafiei and Alberto O. Mendelzon. What is this page known for? computing webpage reputations. In The Ninth International WWW Conference, pages 823--835. Elsevier Science, May 2000.
A Survey of Eigenvector Methods of Web Information Retrieval - Langville, Meyer (2004) (2 citations) (Correct)
No context found.
Davood Rafiei and Alberto O. Mendelzon. What is this page known for? computing webpage reputations. In The Ninth International WWW Conference, pages 823--835. Elsevier Science, May 2000.
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