Sciweavers

852 search results - page 156 / 171
» Comparing relevance feedback algorithms for web search
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 3 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
SIGIR
2002
ACM
13 years 7 months ago
Predicting query performance
We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resultin...
Stephen Cronen-Townsend, Yun Zhou, W. Bruce Croft
EPEW
2005
Springer
14 years 1 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....
WWW
2011
ACM
13 years 3 months ago
Inverted index compression via online document routing
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
Gal Lavee, Ronny Lempel, Edo Liberty, Oren Somekh
CLEF
2006
Springer
13 years 12 months ago
UB at GeoCLEF 2006
This paper summarizes the work done at the State University of New York at Buffalo (UB) in the GeoCLEF 2006 track. The approach presented uses pure IR techniques (indexing of sing...
Miguel E. Ruiz, June M. Abbas, David Mark, Stuart ...