Proceedings ArticleDOI
Optimizing search engines using clickthrough data
Thorsten Joachims
- pp 133-142
Reads0
Chats0
TLDR
The goal of this paper is to develop a method that utilizes clickthrough data for training, namely the query-log of the search engine in connection with the log of links the users clicked on in the presented ranking.Abstract:
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches to learning retrieval functions from examples exist, they typically require training data generated from relevance judgments by experts. This makes them difficult and expensive to apply. The goal of this paper is to develop a method that utilizes clickthrough data for training, namely the query-log of the search engine in connection with the log of links the users clicked on in the presented ranking. Such clickthrough data is available in abundance and can be recorded at very low cost. Taking a Support Vector Machine (SVM) approach, this paper presents a method for learning retrieval functions. From a theoretical perspective, this method is shown to be well-founded in a risk minimization framework. Furthermore, it is shown to be feasible even for large sets of queries and features. The theoretical results are verified in a controlled experiment. It shows that the method can effectively adapt the retrieval function of a meta-search engine to a particular group of users, outperforming Google in terms of retrieval quality after only a couple of hundred training examples.read more
Citations
More filters
Proceedings ArticleDOI
SlateQ: A Tractable Decomposition for Reinforcement Learning with Recommendation Sets
Eugene Ie,Vihan Jain,Jing Wang,Sanmit Narvekar,Ritesh Agarwal,Rui Wu,Heng-Tze Cheng,Tushar Deepak Chandra,Craig Boutilier +8 more
TL;DR: SLATEQ is developed, a decomposition of value-based temporal-difference and Q-learning that renders RL tractable with slates and shows that the long-term value of a slate can be decomposed into a tractable function of its component item-wise LTVs.
Journal ArticleDOI
Multiobjective Pareto-Efficient Approaches for Recommender Systems
Marco Tulio Ribeiro,Nivio Ziviani,Edleno Silva de Moura,Itamar Hata,Anisio Lacerda,Adriano Veloso +5 more
TL;DR: The proposed Pareto-efficient approaches are effective in suggesting items that are likely to be simultaneously accurate, diverse, and novel and discussed scenarios where the system achieves high levels of diversity and novelty without compromising its accuracy.
Patent
Estimating confidence for query revision models
TL;DR: In this paper, the authors propose a query revision architecture that integrates multiple different query revisers, each implementing one or more query revision strategies, and the expected utility is calculated as the product of a frequency of occurrence of the query pair and an increase in quality of the revised query over the first query.
Journal ArticleDOI
WhittleSearch: Interactive Image Search with Relative Attribute Feedback
TL;DR: In this paper, a user describes which properties of exemplar images should be adjusted in order to more closely match his/her mental model of the image sought, and the system learns a set of ranking functions, each of which predicts the relative strength of a nameable attribute in an image.
Proceedings ArticleDOI
Bayesian adaptive user profiling with explicit & implicit feedback
Philip Zigoris,Yi Zhang +1 more
TL;DR: This work demonstrates that the Bayesian modeling approach effectively trades off between shared and user-specific information, alleviating poor initial performance for each user and finds that implicit feedback has very limited unstable predictive value by itself and only marginal value when combined with explicit feedback.
References
More filters
Book
The Nature of Statistical Learning Theory
TL;DR: Setting of the learning problem consistency of learning processes bounds on the rate of convergence ofLearning processes controlling the generalization ability of learning process constructing learning algorithms what is important in learning theory?
Journal ArticleDOI
Support-Vector Networks
Corinna Cortes,Vladimir Vapnik +1 more
TL;DR: High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated and the performance of the support- vector network is compared to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.
Statistical learning theory
TL;DR: Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
Proceedings ArticleDOI
A training algorithm for optimal margin classifiers
TL;DR: A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented, applicable to a wide variety of the classification functions, including Perceptrons, polynomials, and Radial Basis Functions.
Book
Modern Information Retrieval
TL;DR: In this article, the authors present a rigorous and complete textbook for a first course on information retrieval from the computer science (as opposed to a user-centred) perspective, which provides an up-to-date student oriented treatment of the subject.