Sciweavers

550 search results - page 68 / 110
» A general magnitude-preserving boosting algorithm for search...
Sort
View
127
Voted
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 2 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
85
Voted
SIGIR
2003
ACM
15 years 5 months ago
Syntactic features in question answering
Syntactic information potentially plays a much more important role in question answering than it does in information retrieval. Although many people have used syntactic evidence i...
Xiaoyan Li
84
Voted
PODS
2010
ACM
150views Database» more  PODS 2010»
15 years 5 months ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
79
Voted
WWW
2009
ACM
16 years 1 months ago
Graph based crawler seed selection
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles
CIKM
2007
Springer
15 years 6 months ago
Effective top-k computation in retrieving structured documents with term-proximity support
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
Mingjie Zhu, Shuming Shi, Mingjing Li, Ji-Rong Wen