Sciweavers

2504 search results - page 27 / 501
» Methods for comparing rankings of search engine results
Sort
View
EPEW
2005
Springer
14 years 4 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
SIGIR
2010
ACM
14 years 2 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
WWW
2011
ACM
13 years 5 months ago
Identifying primary content from web pages and its application to web search ranking
Web pages are usually highly structured documents. In some documents, content with different functionality is laid out in blocks, some merely supporting the main discourse. In ot...
Srinivas Vadrevu, Emre Velipasaoglu
WEBNET
1996
13 years 12 months ago
Information fusion with ProFusion
: The explosive growth of the World Wide Web, and the resulting information overload, has led to a miniexplosion in World Wide Web search engines. This mini-explosion, in turn, led...
Susan Gauch, Guijun Wang
SIGIR
2009
ACM
14 years 5 months ago
Reciprocal rank fusion outperforms condorcet and individual rank learning methods
Reciprocal Rank Fusion (RRF), a simple method for combining the document rankings from multiple IR systems, consistently yields better results than any individual system, and bett...
Gordon V. Cormack, Charles L. A. Clarke, Stefan B&...