Swarming to rank for information retrieval

  • Authors:
  • Ernesto Diaz-Aviles;Wolfgang Nejdl;Lars Schmidt-Thieme

  • Affiliations:
  • L3S Research Center / Leibniz Universität Hannover, Hannover, Germany;L3S Research Center / Leibniz Universität Hannover, Hannover, Germany;ISMLL / University of Hildesheim, Hildesheim, Germany

  • Venue:
  • Proceedings of the 11th Annual conference on Genetic and evolutionary computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an approach to automatically optimize the retrieval quality of ranking functions. Taking a Swarm Intelligence perspective, we present a novel method, Swarm-Rank, which is well-founded in a Particle Swarm Optimization framework. SwarmRank learns a ranking function by optimizing the combination of various types of evidences such content and hyperlink features, while directly maximizing Mean Average Precision, a widely used evaluation measure in Information Retrieval. Experimental results on well-established Learning To Rank benchmark datasets show that our approach significantly outperformed standard approaches (i.e., BM25) that only use basic statistical information derived from documents collections, and is found to be competitive with Ranking SVM and RankBoost in the task of ranking relevant documents at the very top positions.