Sciweavers

829 search results - page 122 / 166
» Minimal document set retrieval
Sort
View
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
15 years 10 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
ACSC
2008
IEEE
15 years 4 months ago
An investigation on a community's web search variability
Users’ past search behaviour provides a rich context that an information retrieval system can use to tailor its search results to suit an individual’s or a community’s infor...
Mingfang Wu, Andrew Turpin, Justin Zobel
CIKM
2003
Springer
15 years 2 months ago
Using titles and category names from editor-driven taxonomies for automatic evaluation
Evaluation of IR systems has always been difficult because of the need for manually assessed relevance judgments. The advent of large editor-driven taxonomies on the web opens the...
Steven M. Beitzel, Eric C. Jensen, Abdur Chowdhury...
ECML
2006
Springer
15 years 1 months ago
Cost-Sensitive Learning of SVM for Ranking
Abstract. In this paper, we propose a new method for learning to rank. `Ranking SVM' is a method for performing the task. It formulizes the problem as that of binary classific...
Jun Xu, Yunbo Cao, Hang Li, Yalou Huang
TREC
2007
14 years 11 months ago
Parsimonious Language Models for a Terabyte of Text
: The aims of this paper are twofold. Our first aim is to compare results of the earlier Terabyte tracks to the Million Query track. We submitted a number of runs using different ...
Djoerd Hiemstra, Rongmei Li, Jaap Kamps, Rianne Ka...