scispace - formally typeset
Proceedings ArticleDOI

Optimizing search engines using clickthrough data

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

Understanding User Satisfaction with Intelligent Assistants

TL;DR: A user study designed to measure user satisfaction over a range of typical scenarios of use is described, finding that the notion of satisfaction varies across different scenarios, and that overall task-level satisfaction cannot be reduced to query- level satisfaction alone.
Posted Content

Deep Learning the City : Quantifying Urban Perception At A Global Scale

TL;DR: In this article, a Siamese-like convolutional neural network was used to predict human judgments of pairwise image comparisons. But, the accuracy of the predictions was limited by the throughput of current methods, which is too limited to quantify the perception of cities across the world.
Journal ArticleDOI

dipIQ: Blind Image Quality Assessment by Learning-to-Rank Discriminable Image Pairs

TL;DR: This paper shows that a vast amount of reliable training data in the form of quality-discriminable image pairs (DIPs) can be obtained automatically at low cost by exploiting large-scale databases with diverse image content, and learns an opinion-unaware BIQA (OU-BIQA, meaning that no subjective opinions are used for training) model from millions of DIPs, leading to a DIP inferred quality (dipIQ) index.
Proceedings ArticleDOI

Collaborative ranking

TL;DR: This work proposes novel models which approximately optimize NDCG for the recommendation task, essentially variations on matrix factorization models where the features associated with the users and the items for the ranking task are learned.
Journal ArticleDOI

Robust ordinal regression in preference learning and ranking

TL;DR: The paper clarifies the specific interpretation of the concept of preference learning adopted in ROR and MCDA, comparing it to the usual concept of preferences considered within ML.
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

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.
Related Papers (5)