Skip navigation
Skip navigation

Learning to Rank and Quadratic Assignment

Mensink, Thomas; Verbeek, Jakob; Caetano, Tiberio

Description

In this paper we show that the optimization of several ranking-based performance measures, such as precision-at-k and average-precision, is intimately related to the solution of quadratic assignment problems. Both the task of test-time prediction of the best ranking and the task of constraint generation in estimators based on structured support vector machines can all be seen as special cases of quadratic assignment problems. Although such problems are in general NP-hard, we identify a...[Show more]

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
URI: http://hdl.handle.net/1885/39678
Source: Learning to Rank and Quadratic Assignment

Download

File Description SizeFormat Image
01_Mensink_Learning_to_Rank_and_Quadratic_2011.pdf140.88 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator