Artificial intelligence & Information retrieval

Month: August 2013

CIKM 2013 paper on the world’s playlist online

“Inside the world’s playlist” by Wouter Weerkamp, Manos Tsagkias and Maarten de Rijke is available online now.

In the paper we describe Streamwatchr, a real-time system for analyzing the music listening behavior of people around the world. Streamwatchr collects music-related tweets, extracts artists and songs, and visualizes the results in three ways: (i) currently trending songs and artists, (ii) newly discovered songs, and (iii) popularity statistics per country and world-wide for both songs and artists.

Living Labs’13 paper on Lerot, an online learning to rank framework, online

“Lerot: An online learning to rank framework” by Anne Schuth, Katja Hofmann (Microsoft Research), Shimon Whiteson and Maarten de Rijke is available online now.

Online learning to rank methods for IR allow retrieval systems to optimize their own performance directly from interactions with users via click feedback. In the software package Lerot, presented in this paper, we have bundled all ingredients needed for experimenting with online learning to rank for IR. Lerot includes several online learning algorithms, interleaving methods and a full suite of ways to evaluate these methods. In the absence of real users, the evaluation method bundled in the software package is based on simulations of users interacting with the search engine. The software presented here has been used to verify ndings of over six papers at major information retrieval venues over the last few years.

CIKM 2013 paper on evaluating search using interleaving online

“Evaluating aggregated search using interleaving” by Aleksandr Chuklin (Google), Anne Schuth, Katja Hofmann (Microsoft Research), Pavel Serdyukov (Yandex) and Maarten de Rijke is available online now.

A result page of a modern web search engine is often much more complicated than a simple list of “ten blue links.” In particular, a search engine may combine results from different sources (e.g., Web, News, and Images), and display these as grouped results to provide a better user experience. Such a system is called an aggregated or federated search system.

Because search engines evolve over time, their results need to be constantly evaluated. However, one of the most efficient and widely used evaluation methods, interleaving, cannot be directly applied to aggregated search systems, as it ignores the need to group results originating from the same source (vertical results).

We propose an interleaving algorithm that allows comparisons of search engine result pages containing grouped vertical documents. We compare our algorithm to existing interleaving algorithms and other evaluation methods (such as A/B-testing), both on real-life click log data and in simulation experiments. We find that our algorithm allows us to perform unbiased and accurate interleaved comparisons that are comparable to conventional evaluation techniques. We also show that our interleaving algorithm produces a ranking that does not substantially alter the user experience, while being sensitive to changes in both the vertical result block and the non-vertical document rankings. All this makes our proposed interleaving algorithm an essential tool for comparing IR systems with complex aggregated pages.

© 2022 Maarten de Rijke

Theme by Anders NorenUp ↑