Sciweavers

550 search results - page 73 / 110
» A general magnitude-preserving boosting algorithm for search...
Sort
View
HT
2009
ACM
13 years 5 months ago
Retrieving broken web links using an approach based on contextual information
In this short note we present a recommendation system for automatic retrieval of broken Web links using an approach based on contextual information. We extract information from th...
Juan Martinez-Romo, Lourdes Araujo
WWW
2009
ACM
14 years 8 months ago
Learning consensus opinion: mining data from a labeling game
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus ranki...
Paul N. Bennett, David Maxwell Chickering, Anton M...
WWW
2010
ACM
14 years 2 months ago
The anatomy of an ad: structured indexing and retrieval for sponsored search
The core task of sponsored search is to retrieve relevant ads for the user’s query. Ads can be retrieved either by exact match, when their bid term is identical to the query, or...
Michael Bendersky, Evgeniy Gabrilovich, Vanja Josi...
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
14 years 2 months ago
Discovering and using groups to improve personalized search
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
Jaime Teevan, Meredith Ringel Morris, Steve Bush
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
14 years 7 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...