You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

QuickRank: a C++ Suite of Learning to Rank Algorithms

Authors:

Gabriele Capannini, Domenico Dato , Claudio Lucchese , Monica Mori , Franco Maria Nardini , Salvatore Orlando , Raffaele Perego , Nicola Tonellotto

Research group:

Ubiquitous Computing

Publication Type:

Conference/Workshop Paper

Venue:

6th Italian Information Retrieval Workshop

Abstract

Ranking is a central task of many Information Retrieval (IR) problems, particularly challenging in the case of large-scale Web collections where it involves effectiveness requirements and efficiency constraints that are not common to other ranking-based applications. This paper describes QuickRank, a C++ suite of efficient and effective Learning to Rank (LtR) algorithms that allows high-quality ranking functions to be devised from possibly huge training datasets. QuickRank is a project with a double goal: i) answering industrial need of Tiscali S.p.A. for a flexible and scalable LtR solution for learning ranking models from huge training datasets; ii) providing the IR research community with a flexible, extensible and efficient LtR framework to design LtR solutions and fairly compare the performance of different algorithms and ranking models. This paper presents our choices in designing QuickRank and report some preliminary use experiences.

Bibtex

@inproceedings{Capannini4154,
author = {Gabriele Capannini and Domenico Dato and Claudio Lucchese and Monica Mori and Franco Maria Nardini and Salvatore Orlando and Raffaele Perego and Nicola Tonellotto},
title = {QuickRank: a C++ Suite of Learning to Rank Algorithms},
month = {May},
year = {2015},
booktitle = {6th Italian Information Retrieval Workshop},
url = {http://www.es.mdu.se/publications/4154-}
}