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
Dynamically-optimized context in recommender systems
TL;DR: This paper presents a framework that separates the contextual concerns from the actual recommendation module, so that contexts can be readily shared across applications, and devise a learning algorithm to dynamically identify the optimal set of contexts for a specific recommendation task and user.
Proceedings ArticleDOI
On the Theory of Weak Supervision for Information Retrieval
Hamed Zamani,W. Bruce Croft +1 more
TL;DR: It is proved that given some sufficient constraints on the loss function, weak supervision is equivalent to supervised learning under uniform noise, and an upper bound for the empirical risk of weak supervision in case of non-uniform noise is found.
Proceedings ArticleDOI
Towards general models of player affect
TL;DR: This paper uses three dissimilar games whose players annotated their arousal levels on video recordings of their own playthroughs to construct models mapping ranks of arousal to skin conductance and gameplay logs via preference learning and uses a form of cross-game validation to test the generality of the obtained models.
Patent
Merging of results in distributed information retrieval
TL;DR: In this paper, a search manager is in communication with a plurality of components, wherein a component is a search engine working on a document collection and returning results in the form of a list of documents to a search query.
Book
Contextual Search: A Computational Framework
TL;DR: This paper presents a meta-search architecture that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually cataloging and evaluating documents for relevance and quality.
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.