Sciweavers

8 search results - page 1 / 2
» Reducing Click and Skip Errors in Search Result Ranking
Sort
View
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
14 years 5 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
ICDE
2009
IEEE
251views Database» more  ICDE 2009»
14 years 6 months ago
Contextual Ranking of Keywords Using Click Data
The problem of automatically extracting the most interesting and relevant keyword phrases in a document has been studied extensively as it is crucial for a number of applications. ...
Utku Irmak, Vadim von Brzeski, Reiner Kraft
CIKM
2009
Springer
13 years 11 months ago
Post-rank reordering: resolving preference misalignments between search engines and end users
No search engine is perfect. A typical type of imperfection is the preference misalignment between search engines and end users, e.g., from time to time, web users skip higherrank...
Chao Liu, Mei Li, Yi-Min Wang
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
13 years 11 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 5 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li