Sciweavers

302 search results - page 45 / 61
» Smoothing clickthrough data for web search ranking
Sort
View
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 14 days ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
IJIRR
2011
135views more  IJIRR 2011»
14 years 4 months ago
Query Recommendation for Improving Search Engine Results
— recently, search engines become more critical for finding information over the World Wide Web where web content growing fast, the user's satisfaction of search engine resu...
Hamada M. Zahera, Gamal F. El-Hady, W. F. Abd El-W...
VLDB
2008
ACM
170views Database» more  VLDB 2008»
15 years 10 months ago
A multi-ranker model for adaptive XML searching
The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of interaction device...
Ho Lam Lau, Wilfred Ng
70
Voted
SIGIR
2005
ACM
15 years 3 months ago
Relevance weighting for query independent evidence
A query independent feature, relating perhaps to document content, linkage or usage, can be transformed into a static, per-document relevance weight for use in ranking. The challe...
Nick Craswell, Stephen E. Robertson, Hugo Zaragoza...
ICDM
2006
IEEE
139views Data Mining» more  ICDM 2006»
15 years 3 months ago
Detecting Link Spam Using Temporal Information
How to effectively protect against spam on search ranking results is an important issue for contemporary web search engines. This paper addresses the problem of combating one majo...
Guoyang Shen, Bin Gao, Tie-Yan Liu, Guang Feng, Sh...